An exact reduction technique for the k-colour shortest path problem

DOI10.1016/j.cor.2022.106027OpenAlexW4296935124MaRDI QIDQ2108122

Davide Donato Russo, Carmine Cerrone

Publication date: 19 December 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2022.106027

zbMATH Keywords

shortest pathDijkstra algorithmgraph reductionlabelled graph

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price
• Solving resource constrained shortest path problems with LP-based methods
• The constrained shortest path tour problem
• Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems
• A mixed integer linear formulation for the minimum label spanning tree problem
• A two-level metaheuristic for the all colors shortest path problem
• Exact approaches for the orderly colored longest path problem: performance comparison
• The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach
• On the complexity of rainbow spanning forest problem
• Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
• A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems
• A hybrid metaheuristic for the minimum labeling spanning tree problem
• Solving shortest path problems with a weight constraint and replenishment arcs
• The rainbow spanning forest problem
• Resource constrained shortest path problems in path planning for fleet management
• A survey of resource constrained shortest path problems: Exact solution approaches
• An algorithm for the resource constrained shortest path problem
• Comparison of metaheuristics for the k‐labeled spanning forest problem
• Shortest Path Problems with Resource Constraints