Mostrar el registro sencillo del ítem

A review of algorithmic enhancements for Benders decomposition

hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
dc.contributor.authorŞEN, Halil
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
dc.contributor.authorDETIENNE, Boris
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
dc.contributor.authorSADYKOV, Ruslan
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
dc.contributor.authorVANDERBECK, François
dc.date.accessioned2024-04-04T03:11:55Z
dc.date.available2024-04-04T03:11:55Z
dc.date.created2016-05-16
dc.date.issued2016-05-16
dc.date.conference2016-05-16
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/193815
dc.description.abstractEnIn Benders decomposition approach to mixed integer programs , the optimization is carried in two stages: key first-stage decision variables are optimized using a polyhedral approximation of the full-blown problem projection, then a separation problem expressed in the second-stage variables is solved to check if the current first-stage solution is truly feasible, and otherwise, it produces a violated inequality. Such cutting-plane algorithms suffer from several drawbacks and may have very bad convergence rates. 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 explaining these techniques in simple terms and unified notations, showing that in several cases, different proposals of the literature boil down to the same key ideas. We classify methods into specific initialization mode, stabilization techniques, strategies to select the separation point, and cut generation strategies. Where available, we highlight numerical benchmarks that have resulted from such enhancements.
dc.language.isoen
dc.subject.enBenders Decomposition
dc.subject.enCutting Plane Algorithm
dc.subject.enStabi- lization Techniques
dc.title.enA review of algorithmic enhancements for Benders decomposition
dc.typeCommunication dans un congrès
dc.subject.halInformatique [cs]/Recherche opérationnelle [cs.RO]
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.conference.titleISCO 2016 - 4th International Symposium on Combinatorial Optimization
bordeaux.countryIT
bordeaux.conference.cityVietri sul Mare
bordeaux.peerReviewedoui
hal.identifierhal-01426727
hal.version1
hal.invitednon
hal.proceedingsoui
hal.conference.end2016-05-18
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-01426727v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2016-05-16&rft.au=%C5%9EEN,%20Halil&DETIENNE,%20Boris&SADYKOV,%20Ruslan&VANDERBECK,%20Fran%C3%A7ois&rft.genre=unknown


Archivos en el ítem

ArchivosTamañoFormatoVer

No hay archivos asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem