𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A dual algorithm for the constrained shortest path problem

✍ Scribed by Gabriel Y. Handler; Israel Zang

Publisher
John Wiley and Sons
Year
1980
Tongue
English
Weight
878 KB
Volume
10
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Dual algorithms for the shortest path tr
Dual algorithms for the shortest path tree problem
✍ Pallottino, Stefano; ScutellοΏ½, Maria Grazia πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 117 KB πŸ‘ 2 views

We consider dual approaches for the Shortest Path Tree problem. After a brief introduction to the problem, we review the most important dual algorithms which have been described in the literature for its solution and propose a new family of dual ascent algorithms. In these algorithms, ''local'' and

The constrained shortest path problem
The constrained shortest path problem
✍ Y. P. Aneja; K. P. K. Nair πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 368 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 note on the constrained shortest-path
A note on the constrained shortest-path problem
✍ Arun K. Pujari; Suneeta Agarwal; V. P. Gulati πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 135 KB πŸ‘ 1 views