𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new variant of the partitioning shortest path algorithm

✍ Scribed by Nancy V. Phillips

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
370 KB
Volume
13
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An algorithm for the ranking of shortest
An algorithm for the ranking of shortest paths
✍ JosΓ©Augusto Azevedo; Maria EmΓ­lia O. Santos Costa; Joaquim JoΓ£o E.R. Silvestre M πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 631 KB
An Incremental Algorithm for a Generaliz
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
✍ G. Ramalingam; Thomas Reps πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 363 KB

The grammar problem, a generalization of the single-source shortest-path prob-Ž Ž . Ž . . lem introduced by D. E. Knuth Inform. Process. Lett. 6 1 1977 , 1᎐5 is to compute the minimum-cost derivation of a terminal string from each nonterminal of a given context-free grammar, with the cost of a deriv

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