[Coin-bcpdiscuss] Recursivly use of BCP and branching

[Robin Lougee-Heimer]

Hopefully someone else can answer - but if not, Laci will be back the end 
of Dec.
Robin

----------------------------------------------------------------------------------
Robin Lougee-Heimer
IBM TJ Watson Research Center
1101 Kitchawan Road, Yorktown Heights, NY 10598
ph: 914-945-3032   fax: 914-945-3434 
robinlh at us.ibm.com
http://www.coin-or.org





"Simon Spoorendonk" <spooren at diku.dk> 
Sent by: coin-bcpdiscuss-bounces at list.coin-or.org
12/21/2005 12:58 PM

To
<coin-bcpdiscuss at list.coin-or.org>
cc

Subject
[Coin-bcpdiscuss] Recursivly use of BCP and branching






We have a few questions about BCP? It is implemented and working, however 
not without several workarounds. We hope that answers to the following 
questions could ?clean?/speed the code up. 
 
1. We have several applications using the BCP framework and would like to 
call one within the other, i.e. during column generation we wish to solve 
another problem solved with branch-and-cut (both are implemented with 
BCP). Is this possible in an easy way (not calling an external program, 
but doing it in memory)?
2. Is it possible to do variable generation and cut generation doing 
strong branching without hacking the strong branch loop of BCP?
3. When branching on cuts while column generating, is it possible to do 
this better than adding a cut for each branch child and fixing the bounds 
(in select_branching_candidates)? And how are we guaranteed that the cut 
(algo) is never removed without setting BCP_IneffectiveConstraints = 0? 
Should the cuts be added as core cuts?
 
Simon Spoorendonk,
DIKU, University of Copenhagen, Denmark
_______________________________________________
Coin-bcpdiscuss mailing list
Coin-bcpdiscuss at list.coin-or.org
http://list.coin-or.org/mailman/listinfo/coin-bcpdiscuss

-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://list.coin-or.org/pipermail/bcp/attachments/20051221/d58e19e3/attachment.html