Algorithms for the Weight Constrained Shortest Path Problem
From MaRDI portal
Publication:2767722
DOI10.1111/1475-3995.00003zbMath1003.90037OpenAlexW2159176259MaRDI QIDQ2767722
Irina Dumitrescu, Natashia Boland
Publication date: 23 July 2002
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/1475-3995.00003
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)
Related Items
Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context, An optimal algorithm for the obstacle neutralization problem, A penalty search algorithm for the obstacle neutralization problem, Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price, An exact bidirectional pulse algorithm for the constrained shortest path, The aircraft routing problem with refueling, Some observations about the extreme points of the generalized cardinality-constrained shortest path problem polytope, A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation, A column generation heuristic for a dynamic generalized assignment problem, Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem, Solving the shortest path tour problem
