Acceleration strategies for the weight constrained shortest path problem with replenishment

DOI10.1007/s11590-014-0742-xzbMath1302.90231OpenAlexW2003282559WikidataQ58759978 ScholiaQ58759978MaRDI QIDQ479240

Andrés L. Medaglia, Leonardo Lozano, Manuel A. Bolívar

Publication date: 5 December 2014

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1992/12469

zbMATH Keywords

replenishmentconstrained shortest path problemlarge-scale networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (4)

An exact method for the biobjective shortest path problem for large-scale road networks ⋮ An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem ⋮ Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks ⋮ An exact bidirectional pulse algorithm for the constrained shortest path

Uses Software

• DIMACS

Cites Work

• On an exact method for the constrained shortest path problem
• A comparison of solution strategies for biobjective shortest path problems
• Depth-first iterative-deepening: An optimal admissible tree search
• Solving shortest path problems with a weight constraint and replenishment arcs
• The shortest route problem with constraints
• A dual algorithm for the constrained shortest path problem
• Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem

This page was built for publication: Acceleration strategies for the weight constrained shortest path problem with replenishment