✦ LIBER ✦

Cutting planes for branch-and-price algorithms

✍ Scribed by Guy Desaulniers; Jacques Desrosiers; Simon Spoorendonk

Publisher: John Wiley and Sons
Year: 2011
Tongue: English
Weight: 133 KB
Volume: 58
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20471

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch-and-cut-and-price algorithm for

A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation

✍ Ivana Ljubić 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB 👁 1 views

A branch-and-cut algorithm for partition

A branch-and-cut algorithm for partition coloring

✍ Yuri Frota; Nelson Maculan; Thiago F. Noronha; Celso C. Ribeiro 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 294 KB 👁 1 views

A robust branch-cut-and-price algorithm

A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem

✍ Artur Pessoa; Eduardo Uchoa; Marcus Poggi de Aragão 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB 👁 1 views

The ABACUS system for branch-and-cut-and

The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization

✍ Michael Jünger; Stefan Thienel 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 209 KB 👁 2 views

A branch-and-cut algorithm for the preem

A branch-and-cut algorithm for the preemptive swapping problem

✍ Charles Bordenave; Michel Gendreau; G. Laporte 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 247 KB 👁 1 views

## Abstract In the swapping problem (SP), every vertex of a complete graph may supply and demand an object of a known type. A vehicle of unit capacity starting and ending its tour at an arbitrary vertex is available for carrying objects of given types between vertices. The SP consists of determinin

A branch-and-cut algorithm for the nonpr

A branch-and-cut algorithm for the nonpreemptive swapping problem

✍ Charles Bordenave; Michel Gendreau; Gilbert Laporte 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB 👁 1 views