Branching in Branch-and-Price: a Generic Scheme
| 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:31:57Z | |
| dc.date.available | 2024-04-04T02:31:57Z | |
| dc.date.issued | 2011 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/190343 | |
| dc.description.abstractEn | Developing a branching scheme that is compatible with the column generation procedure can be challenging. Application specific and generic schemes have been proposed in the literature, but they have their drawbacks. One generic scheme is to implement standard branching in the space of the compact formulation to which the Dantzig-Wolfe reformulation was applied. However, in the presence of multiple identical subsystems, the mapping to the original variable space typically induces symmetries. An alternative, in an application specific context, can be to expand the compact formulation to offer a wider choice of branching variables. Other existing generic schemes for use in branch-and-price imply modifications to the pricing problem. This is a concern because the pricing oracle on which the method relies might become obsolete beyond the root node. This paper presents a generic branching scheme in which the pricing oracle of the root node remains of use after branching (assuming that the pricing oracle can handle bounds on the subproblem variables). The scheme does not require the use of an extended formulation of the original problem. It proceeds by recursively partitioning the subproblem solution set. Branching constraints are enforced in the pricing problem instead of being dualized via Lagrangian relaxation, and the pricing problem is solved by a limited number of calls to the pricing oracle. This generic scheme builds on previously proposed approaches and unifies them. We illustrate its use on the cutting stock and bin packing problems. This is the first branch-and-price algorithm capable of solving such problems to integrality without modifying the subproblem or expanding its variable space. | |
| dc.language.iso | en | |
| dc.publisher | Springer | |
| dc.subject.en | Integer Programming | |
| dc.subject.en | Dantzig-Wolfe reformulation | |
| dc.subject.en | Branch-and-Price. | |
| dc.subject.en | Branch-and-Price | |
| dc.title.en | Branching in Branch-and-Price: a Generic Scheme | |
| dc.type | Article de revue | |
| dc.identifier.doi | 10.1007/s10107-009-0334-1 | |
| dc.subject.hal | Informatique [cs]/Recherche opérationnelle [cs.RO] | |
| dc.subject.hal | Mathématiques [math]/Combinatoire [math.CO] | |
| bordeaux.journal | Mathematical Programming, Series A | |
| bordeaux.page | 249-294 | |
| bordeaux.volume | 130 | |
| 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.peerReviewed | oui | |
| hal.identifier | inria-00311274 | |
| hal.version | 1 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//inria-00311274v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Mathematical%20Programming,%20Series%20A&rft.date=2011&rft.volume=130&rft.spage=249-294&rft.epage=249-294&rft.au=VANDERBECK,%20Fran%C3%A7ois&rft.genre=article |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||