Towards a generic branch-and-price solver: progress report
| hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
| hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
| dc.contributor.author | VANDERBECK, François | |
| dc.date.accessioned | 2024-04-04T02:36:44Z | |
| dc.date.available | 2024-04-04T02:36:44Z | |
| dc.date.issued | 2008 | |
| dc.date.conference | 2008-05-12 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/190743 | |
| dc.description.abstractEn | Commercial MIP solvers have made a lot of progress in the last decade. Impressive speed-up factors have been recorded when cutting plane approaches have made their way into these generic solvers. The latest advances result from the combination of automatic cutting plane generation, pre-processing techniques (including imports from constraint programming), intelligent enumeration schemes (such as the so-called strong branching), and MIP based heuristics. The trend is to transform successful application specific tools into generic approaches that can be integrated into a general purpose solver. Despite its recognized efficiency in application specific contexts, the column generation approach has not yet made its way into commercial solvers. Dantzig-Wolfe reformulation is viewed by the scientific community as necessarily application specific. Tool box softwares, building over commercial solver, are available to ease the implementation of a branch-and-price approach (f.i., Abacus, BCP, Minto or Symphony). But, they require user expertise in the method. Therefore, the question that we raise is whether, in future version of commercial MIP solver, one could hope to tackle a problem by Branch-and-Price, simply by ticking an option such as the one that triggers automatic cut generation. One also wonders how this would combine with the existing tools. | |
| dc.language.iso | en | |
| dc.title.en | Towards a generic branch-and-price solver: progress report | |
| dc.type | Communication dans un congrès | |
| dc.subject.hal | Informatique [cs]/Recherche opérationnelle [cs.RO] | |
| dc.subject.hal | Mathématiques [math]/Optimisation et contrôle [math.OC] | |
| bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.conference.title | CORS/Optimization Days | |
| bordeaux.country | CA | |
| bordeaux.conference.city | Québec | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | inria-00392250 | |
| hal.version | 1 | |
| hal.invited | oui | |
| hal.proceedings | oui | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//inria-00392250v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2008&rft.au=VANDERBECK,%20Fran%C3%A7ois&rft.genre=unknown |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||