✦ LIBER ✦

Dynamic programming algorithms for the conditional covering problem on path and extended star graphs

✍ Scribed by Jennifer A. Horne; J. Cole Smith

Publisher: John Wiley and Sons
Year: 2005
Tongue: English
Weight: 144 KB
Volume: 46
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20086

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A dynamic programming algorithm for the

A dynamic programming algorithm for the conditional covering problem on tree graphs

✍ Jennifer A. Horne; J. Cole Smith 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB 👁 1 views

Algorithms for solving the conditional c

Algorithms for solving the conditional covering problem on paths

✍ Brian J. Lunday; J. Cole Smith; Jeffrey B. Goldberg 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 111 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

A dynamic programming algorithm for the

A dynamic programming algorithm for the shortest path problem with time windows and linear node costs

✍ Ioachim, Irina; G�linas, Sylvie; Soumis, Fran�ois; Desrosiers, Jacques 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 3 views

This paper presents an optimal dynamic programming algorithm, the first such algorithm in the literature to solve the shortest path problem with time windows and additional linear costs on the node service start times. To optimally solve this problem, we propose a new dynamic programming algorithm w