Lagrangian relaxation and enumeration for solving constrained shortest-path problems
From MaRDI portal
Publication:3548726
DOI10.1002/NET.20247zbMATH Open1180.90346OpenAlexW4246153096MaRDI QIDQ3548726FDOQ3548726
Authors: W. Matthew Carlyle, Johannes O. Royset, R. Kevin Wood 
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
Recommendations
- scientific article; zbMATH DE number 3961370
- On an exact method for the constrained shortest path problem
- An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem
- Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem
- scientific article; zbMATH DE number 1910903
Cites Work
- A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
- Flight Attendant Rostering for Short-Haul Airline Operations
- A Column Generation Approach for Large-Scale Aircrew Rostering Problems
- Algorithms for finding paths with multiple constraints
- Airline Crew Scheduling: A New Formulation and Decomposition Algorithm
- Time depending shortest-path problems with applications to railway networks
- The shortest route problem with constraints
- Shortest chain subject to side constraints
- An algorithm for the resource constrained shortest path problem
- Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
- Near-shortest and K-shortest simple paths
- Searching for the Multiplier in One-Constraint Optimization Problems
- Implementation and efficiency of Moore-algorithms for the shortest route problem
- An efficient implementation of an algorithm for findingK shortest simple paths
- Title not available (Why is that?)
Cited In (39)
- A multiphase dynamic programming algorithm for the shortest path problem with resource constraints
- Cost projection methods for the shortest path problem with crossing costs
- The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach
- An anytime algorithm for constrained stochastic shortest path problems with deterministic policies
- Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem
- Efficient large-scale multi-drone delivery using transit networks
- Constraint programming based Lagrangian relaxation for the automatic recording problem
- PathWyse: a flexible, open-source library for the resource constrained shortest path problem
- Title not available (Why is that?)
- A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems
- An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
- Optimal routing with failure-independent path protection
- An integer optimality condition for column generation on zero-one linear programs
- Computing constrained shortest-paths at scale
- Dynamic programming approaches to solve the shortest path problem with forbidden paths
- Bus driver duty optimization using an integer programming and evolutionary hybrid algorithm
- A survey of motion planning algorithms from the perspective of autonomous UAV guidance
- Shortest path network problems with stochastic arc weights
- Algorithms for non-linear and stochastic resource constrained shortest path
- A branch-and-cut algorithm for the capacitated profitable tour problem
- The constrained shortest path problem with stochastic correlated link travel times
- On an exact method for the constrained shortest path problem
- A penalty search algorithm for the obstacle neutralization problem
- MineLib: a library of open pit mining problems
- Robust scheduling on a single machine to minimize total flow time
- \(\varepsilon\)-approximation schemes for the constrained shortest path problem
- An optimal algorithm for the obstacle neutralization problem
- A time-indexed generalized vehicle routing model and stabilized column generation for military aircraft mission planning
- Lagrangian relaxation for the multiple constrained robust shortest path problem
- Eco-routing problem for the delivery of perishable products
- A directional heuristics pulse algorithm for a two resources constrained shortest path problem with reinitialization
- Solving shortest path problems with a weight constraint and replenishment arcs
- A survey of resource constrained shortest path problems: exact solution approaches
- Algorithms and Computation
- Constraint-based local search for constrained optimum paths problems
- Cost-based filtering for shorter path constraints
- Adaptive CP-based Lagrangian relaxation for TSP solving
- Path optimization for the resource-constrained searcher
- Title not available (Why is that?)
This page was built for publication: Lagrangian relaxation and enumeration for solving constrained shortest-path problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548726)
