✦ LIBER ✦

A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem

✍ Scribed by Hadjar, Ahmed; Marcotte, Odile; Soumis, François

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch and bound algorithm for the mul

✍ G. Carpaneto; M. Dell'amico; M. Fischetti; P. Toth 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 814 KB

Iterated local search for the multiple d

✍ Benoît Laurent; Jin-Kao Hao 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 500 KB

A new branch-and-cut algorithm for the c

✍ Jens Lysgaard; Adam N. Letchford; Richard W. Eglese 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 203 KB

A comparison of five heuristics for the

✍ Ann-Sophie Pepin; Guy Desaulniers; Alain Hertz; Dennis Huisman 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 614 KB

An Exact Algorithm for the Simplified Mu

✍ M.A. Boschetti; A. Mingozzi; S. Ricciardelli 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 199 KB

A robust branch-cut-and-price algorithm

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