Mostrar el registro sencillo del ítem
Revisiting Benders Decomposition
hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
dc.contributor.author | DETIENNE, Boris | |
hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
dc.contributor.author | SADYKOV, Ruslan | |
hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
dc.contributor.author | ŞEN, Halil | |
hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
dc.contributor.author | VANDERBECK, Francois | |
dc.date.accessioned | 2024-04-04T03:10:58Z | |
dc.date.available | 2024-04-04T03:10:58Z | |
dc.date.created | 2017-02-10 | |
dc.date.issued | 2017-02-10 | |
dc.date.conference | 2017-02-10 | |
dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/193730 | |
dc.description.abstractEn | Benders decomposition entails a two-stage optimization approach to a mixed integer program: first-stage decision variables are optimized using a polyhedral approximation of the problem's projection; then a separation problem expressed in the second-stage variables is solved to check if the current first-stage solution is feasible; otherwise, it produces a violated inequality. Such cutting-plane algorithm can suffer severe drawbacks regarding its convergence rate. We review the battery of approaches that have been proposed in the literature to address these drawbacks and to speed-up the algorithm. Our contribution consists in proposing a unified framework to explain these techniques, showing that in several cases, different proposals of the literature boil down to the same key ideas. We complete this reviewwith a numerical study of implementation options for Benders algorithmic features and enhancements. | |
dc.language.iso | en | |
dc.title.en | Revisiting Benders Decomposition | |
dc.type | Communication dans un congrès | |
dc.subject.hal | Informatique [cs]/Recherche opérationnelle [cs.RO] | |
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 | Symposium Combinatorial Optimization and Applications | |
bordeaux.country | GB | |
bordeaux.conference.city | Edinburgh | |
bordeaux.peerReviewed | non | |
hal.identifier | hal-01467283 | |
hal.version | 1 | |
hal.invited | oui | |
hal.proceedings | non | |
hal.conference.end | 2017-02-10 | |
hal.popular | non | |
hal.audience | Internationale | |
hal.origin.link | https://hal.archives-ouvertes.fr//hal-01467283v1 | |
bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2017-02-10&rft.au=DETIENNE,%20Boris&SADYKOV,%20Ruslan&%C5%9EEN,%20Halil&VANDERBECK,%20Francois&rft.genre=unknown |
Archivos en el ítem
Archivos | Tamaño | Formato | Ver |
---|---|---|---|
No hay archivos asociados a este ítem. |