An exact algorithm for the elementary shortest path problem with resource constraints
Year of publication: |
February 2016
|
---|---|
Authors: | Lozano, Leonardo ; Duque, Daniel ; Medaglia, Andrés L. |
Published in: |
Transportation science : a journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : Transportation Science & Logistics Society of the Institute for Operations Research and the Management Sciences, ISSN 0041-1655, ZDB-ID 160958-0. - Vol. 50.2016, 1, p. 348-357
|
Subject: | vehicle routing | shortest path problem | column generation | vehicle routing problem with time windows | Tourenplanung | Vehicle routing problem | Algorithmus | Algorithm | Graphentheorie | Graph theory | Operations Research | Operations research | Heuristik | Heuristics |
-
Optimal capacitated ring trees
Hill, Alessandro, (2016)
-
Two heuristics for the capacitated minimum spanning tree problem with time windows
Kritikos, Manolis N., (2019)
-
Jozefowiez, Nicolas, (2013)
- More ...
-
An exact method for the biobjective shortest path problem for large-scale road networks
Duque, Daniel, (2015)
-
An exact method for the biobjective shortest path problem for large-scale road networks
Duque, Daniel, (2015)
-
Solving the Orienteering Problem with Time Windows via the Pulse Framework
Duque, Daniel, (2015)
- More ...