An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem

DOI10.1016/j.amc.2015.05.109zbMath1410.90233OpenAlexW606997861MaRDI QIDQ1664248

Antonio Sedeño-Noda, Sergio Fernando Alonso Rodríguez

Publication date: 24 August 2018

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2015.05.109

zbMATH Keywords

shortest path algorithmsconstrained shortest pathsranking best solutions

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (6)

Solving a constrained economic lot size problem by ranking efficient production policies ⋮ A novel approach to subgraph selection with multiple weights on arcs ⋮ Primal column generation framework for vehicle and crew scheduling problems ⋮ An exact bidirectional pulse algorithm for the constrained shortest path ⋮ The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm ⋮ The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach

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
• A bicriterion shortest path algorithm
• A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation
• Enumerating \(K\) best paths in length order in DAGs
• A survey of resource constrained shortest path problems: Exact solution approaches
• Approximation Schemes for the Restricted Shortest Path Problem
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
• A simple efficient approximation scheme for the restricted shortest path problem

This page was built for publication: An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem