Enhanced methods for the weight constrained shortest path problem

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

Cites Work

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

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