Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem
From MaRDI portal
Publication:3057094
DOI10.1002/net.20292zbMath1207.05201OpenAlexW4247951747MaRDI QIDQ3057094
Natashia Boland, Ranga Muhandiramge
Publication date: 24 November 2010
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20292
Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
A penalty search algorithm for the obstacle neutralization problem ⋮ Solving shortest path problems with a weight constraint and replenishment arcs ⋮ Dynamic programming approaches to solve the shortest path problem with forbidden paths ⋮ A survey of resource constrained shortest path problems: Exact solution approaches ⋮ Lagrangian relaxation for the multiple constrained robust shortest path problem ⋮ A branch-and-cut algorithm for the capacitated profitable tour problem ⋮ Solving the shortest path tour problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Search space reduction in QoS routing.
- Flight String Models for Aircraft Fleeting and Routing
- On a routing problem
- The Cutting-Plane Method for Solving Convex Programs
- Lagrangian relaxation and enumeration for solving constrained shortest-path problems
- Shortest chain subject to side constraints
- A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
- An algorithm for the resource constrained shortest path problem
- Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
This page was built for publication: Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem
