A note on the implementation of the BFC-MSMIP algorithm in C++ by using COIN-OR as an optimization engine

1. Escudero Bueno, Laureano Fernando
2. Garín Martín, María Araceli
3. Merino Maestre, María
4. Pérez Sainz de Rozas, Gloria

Exportar

Exportar

×

MLA

modern-language-association

APA

apa

Chicago

chicago-fullnote-bibliography

Harvard

harvard-cite-them-right

Vancouver

vancouver-author-date

---

RIS BibTex

Exportar

×

El documento no se puede exportar porque pertenece a otro portal.

Texto completo

lock_openADDI externo

DIALNET GOOGLE SCHOLAR lock_openADDI editor

Otras publicaciones en: Documentos de Trabajo BILTOKI

Resumen

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 description 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.

Fuente de los datos: Dialnet