𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Solving elementary shortest-path problems as mixed-integer programs

✍ Scribed by Michael Drexl, Stefan Irnich

Book ID
120778878
Publisher
Springer
Year
2012
Tongue
German
Weight
200 KB
Volume
36
Category
Article
ISSN
0171-6468

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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