✦ LIBER ✦

Integer programming formulations for the two 4-hop-constrained paths problem

✍ Scribed by David Huygens; A. Ridha Mahjoub

Publisher: John Wiley and Sons
Year: 2007
Tongue: English
Weight: 231 KB
Volume: 49
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20147

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new integer programming formulation fo

A new integer programming formulation for the permutation flowshop problem

✍ A.M. Frieze; J. Yadegar 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 447 KB

New dynamic programming algorithms for t

New dynamic programming algorithms for the resource constrained elementary shortest path problem

✍ Giovanni Righini; Matteo Salani 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 173 KB

## Abstract The resource constrained elementary shortest path problem (RCESPP) arises as a pricing subproblem in branch‐and‐price algorithms for vehicle‐routing problems with additional constraints. We address the optimization of the RCESPP and we present and compare three methods. The first method

Integer programming formulations for the

Integer programming formulations for the multi-depot vehicle routing problem: Comments on a paper by Kulkarni and Bhave

✍ Gilbert Laporte 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 892 KB

A remark on “Integer linear programming

A remark on “Integer linear programming formulation for a Vehicle Routing Problem” by N.R. Achutan and L. Caccetta, or how to use the Clark & Wright savings to write such integer linear programming formulations

✍ Denis Naddef 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 214 KB