Resource Constrained Shortest Paths

Authors:
Kurt Mehlhorn;Mark Ziegelmann
Affiliations:
-;-
Venue:
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Year:
2000

Citing 9
Cited 15

Approximation of Pareto optima in multiple-objective, shortest-path problems

Operations Research
Approximation schemes for the restricted shortest path problem

Mathematics of Operations Research
The network inhibition problem

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Four results on randomized incremental constructions

Computational Geometry: Theory and Applications
Combinatorial optimization

Combinatorial optimization
Finding the k Shortest Paths

SIAM Journal on Computing
The table layout problem

SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
LEDA: a platform for combinatorial and geometric computing

LEDA: a platform for combinatorial and geometric computing
Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison

WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering

QoS Routing in Communication Networks: Approximation Algorithms Based on the Primal Simplex Method of Linear Programming

IEEE Transactions on Computers
Data structures: time, I/Os, entropy, joules!

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem

INFORMS Journal on Computing
Finding all attractive train connections by multi-criteria Pareto search

ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation

Computers and Operations Research
Shorter path constraints for the resource constrained shortest path problem

CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
GEN-LARAC: a generalized approach to the constrained shortest path problem under multiple additive constraints

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Acceleration of shortest path and constrained shortest path computation

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints

Discrete Optimization
Network Optimization Models for Resource Allocation in Developing Military Countermeasures

Operations Research
Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price

Computers and Operations Research
Resource constrained shortest paths with a super additive objective function

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
A Reference Point Approach for the Resource Constrained Shortest Path Problems

Transportation Science
BER-based Power Scheduling in Wireless Sensor Networks

Journal of Signal Processing Systems
Best upgrade plans for large road networks

SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases

Quantified Score

Hi-index	0.00

Visualization

Abstract

The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theoretical and experimental results for CSP. In the theoretical part we present the hull approach, a combinatorial algorithm for solving a linear programming relaxation and prove that it runs in polynomial time in the case of one resource. In the experimental part we compare the hull approach to previous methods for solving the LP relaxation and give an exact algorithm based on the hull approach. We also compare our exact algorithm to previous exact algorithms and approximation algorithms for the problem.