Lagrangian relaxation and enumeration for solving constrained shortest-path problems
From MaRDI portal
Publication:3548726
DOI10.1002/net.20247zbMath1180.90346OpenAlexW4246153096MaRDI QIDQ3548726
W. Matthew Carlyle, R. Kevin Wood, Johannes O. Royset
Publication date: 17 December 2008
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20247
Related Items (27)
An optimal algorithm for the obstacle neutralization problem ⋮ Bus driver duty optimization using an integer programming and evolutionary hybrid algorithm ⋮ The constrained shortest path problem with stochastic correlated link travel times ⋮ A penalty search algorithm for the obstacle neutralization problem ⋮ On an exact method for the constrained shortest path problem ⋮ MineLib: a library of open pit mining problems ⋮ A survey of motion planning algorithms from the perspective of autonomous UAV guidance ⋮ Algorithms for non-linear and stochastic resource constrained shortest path ⋮ An integer optimality condition for column generation on zero-one linear programs ⋮ An anytime algorithm for constrained stochastic shortest path problems with deterministic policies ⋮ Eco-routing problem for the delivery of perishable products ⋮ A directional heuristics pulse algorithm for a two resources constrained shortest path problem with reinitialization ⋮ Shortest path network problems with stochastic arc weights ⋮ The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach ⋮ A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems ⋮ Solving shortest path problems with a weight constraint and replenishment arcs ⋮ Robust scheduling on a single machine to minimize total flow time ⋮ Path optimization for the resource-constrained searcher ⋮ Dynamic programming approaches to solve the shortest path problem with forbidden paths ⋮ Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem ⋮ Optimal routing with failure-independent path protection ⋮ A survey of resource constrained shortest path problems: Exact solution approaches ⋮ Lagrangian relaxation for the multiple constrained robust shortest path problem ⋮ An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP ⋮ Efficient Large-Scale Multi-Drone Delivery using Transit Networks ⋮ A branch-and-cut algorithm for the capacitated profitable tour problem ⋮ A Time-Indexed Generalized Vehicle Routing Model and Stabilized Column Generation for Military Aircraft Mission Planning
Cites Work
- Unnamed Item
- Time depending shortest-path problems with applications to railway networks
- The shortest route problem with constraints
- Algorithms for finding paths with multiple constraints
- 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
- An efficient implementation of an algorithm for findingK shortest simple paths
- Airline Crew Scheduling: A New Formulation and Decomposition Algorithm
- Flight Attendant Rostering for Short-Haul Airline Operations
- Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
- A Column Generation Approach for Large-Scale Aircrew Rostering Problems
- Implementation and efficiency of Moore-algorithms for the shortest route problem
- Near-shortest and K-shortest simple paths
- Searching for the Multiplier in One-Constraint Optimization Problems
This page was built for publication: Lagrangian relaxation and enumeration for solving constrained shortest-path problems
