Enhanced methods for the weight constrained shortest path problem

DOI10.1002/NET.22210MaRDI QIDQ6566555zbMATH OpenFDO

Authors Guido Tack, Daniel Damir Harabor, Philip Kilby, Mahdi Jalili

Publication date 3 July 2024

Published in Networks (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1002/NET.22210

zbMATH Keywords

bi-objective shortest pathconstrained pathfindingheuristic searchweight constrained shortest path

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Algorithms for the weight constrained shortest path problem
• Acceleration strategies for the weight constrained shortest path problem with replenishment
• An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem
• Solving shortest path problems with a weight constraint and replenishment arcs
• Algorithms and Computation

Cites work

• 2019–2020 <scp>Glover‐Klingman</scp> Prize Winners
• A biobjective Dijkstra algorithm
• A dual algorithm for the constrained shortest path problem
• A note on two problems in connexion with graphs
• A survey of resource constrained shortest path problems: exact solution approaches
• A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation
• Acceleration strategies for the weight constrained shortest path problem with replenishment
• An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem
• An exact bidirectional A^ approach for solving resource-constrained shortest path problems
• An exact bidirectional pulse algorithm for the constrained shortest path
• Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
• Dimensionality reduction in multiobjective shortest path search
• scientific article; zbMATH DE number 3415384 (Why is no real title available?)
• scientific article; zbMATH DE number 7740858 (Why is no real title available?)
• Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
• Minimum cost path problems with relays
• On an exact method for the constrained shortest path problem
• Shortest chain subject to side constraints
• Shortest paths algorithms: Theory and experimental evaluation
• Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
• Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem
• Solving resource constrained shortest path problems with LP-based methods
• Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints

Cited in

(2)

• Optimizing the transport of organs for transplantation
• A fast and simple algorithm for the resource constrained shortest path problem

This page was built for publication: Enhanced methods for the weight constrained shortest path problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566555)