𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW

✍ Scribed by Moshe Dror

Book ID
123687578
Publisher
INFORMS
Year
1994
Tongue
English
Weight
122 KB
Volume
42
Category
Article
ISSN
0030-364X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Average-case complexity of shortest-path
Average-case complexity of shortest-paths problems in the vertex-potential model
✍ Colin Cooper; Alan Frieze; Kurt Mehlhorn; Volker Priebe πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 146 KB πŸ‘ 2 views

We study the average-case complexity of shortest-paths problems in the vertexpotential model. The vertex-potential model is a family of probability distributions on complete directed graphs with arbitrary real edge lengths, but without negative cycles. We show that on a graph with n vertices and wit

On the complexity of finding paths in a
On the complexity of finding paths in a two-dimensional domain I: Shortest paths
✍ Arthur W. Chou; Ker-I Ko πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 342 KB πŸ‘ 2 views

## Abstract The computational complexity of finding a shortest path in a two‐dimensional domain is studied in the Turing machine‐based computational model and in the discrete complexity theory. This problem is studied with respect to two formulations of polynomial‐time computable two‐dimensional do