A note on the implementation of the BFC-MSMIP algorithm in C++ by using COIN-OR as an optimization engine
The aim of this technical report is to present some detailed explanations in order to help to understand and use the algorithm Branch and Fix Coordination for solving MultiStage Mixed Integer Problems (BFC- MSMIP). We have developed an algorithmic approach implemented in a C++ experimental code that uses the optimization engine COmputational INfrastructure for Operations Research (COIN-OR) for solving the auxiliary linear and mixed 0-1 submodels. Now, we give the computational and implementational descrip- tion in order to use this open optimization software not only in the implementation of our procedure but also in similar schemes to be developed by the users.
|Date of creation:||2010|
|Date of revision:|
|Contact details of provider:|| Postal: Avda. Lehendakari, Aguirre, 83, 48015 Bilbao|
Phone: + 34 94 601 3740
Fax: + 34 94 601 4935
Web page: http://www.ea3.ehu.es
More information through EDIRC
|Order Information:|| Postal: Dpto. de Econometría y Estadística, Facultad de CC. Económicas y Empresariales, Universidad del País Vasco, Avda. Lehendakari Aguirre 83, 48015 Bilbao, Spain|
When requesting a correction, please mention this item's handle: RePEc:ehu:biltok:201002. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Alcira Macías)
If references are entirely missing, you can add them using this form.