An exact reduction technique for the k-colour shortest path problem
type: Item
instance of: scholarly article
title: An exact reduction technique for the k-colour shortest path problem
author: C. Cerrone
author: Davide Donato Russo
published in: Computers \& Operations Research
publication date: 2022-12-19T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7634076
zbMATH Keywords: graph reduction
zbMATH Keywords: Dijkstra algorithm
zbMATH Keywords: shortest path
zbMATH Keywords: labelled graph
MaRDI profile type: Publication
full work available at URL: j.cor.2022.106027
OpenAlex ID: W4296935124
cites work: Resource constrained shortest path problems in path planning for fleet management
cites work: An algorithm for the resource constrained shortest path problem
cites work: Q4659605
cites work: A mixed integer linear formulation for the minimum label spanning tree problem
cites work: On the complexity of rainbow spanning forest problem
cites work: The rainbow spanning forest problem
cites work: Exact approaches for the orderly colored longest path problem: performance comparison
cites work: A two-level metaheuristic for the all colors shortest path problem
cites work: Comparison of metaheuristics for the k‐labeled spanning forest problem
cites work: A hybrid metaheuristic for the minimum labeling spanning tree problem
cites work: The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach
cites work: A note on two problems in connexion with graphs
cites work: The constrained shortest path tour problem
cites work: Solving resource constrained shortest path problems with LP-based methods
cites work: Shortest Path Problems with Resource Constraints
cites work: A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems
cites work: Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems
cites work: A survey of resource constrained shortest path problems: exact solution approaches
cites work: Solving shortest path problems with a weight constraint and replenishment arcs
cites work: Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
cites work: Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price
DOI: 10.1016/J.COR.2022.106027
description: scientific article; zbMATH DE number 7634076