The minimum reload \(s-t\) path, trail and walk problems
From MaRDI portal
Publication:987690
DOI10.1016/j.dam.2010.03.009zbMath1209.05131OpenAlexW2056455157MaRDI QIDQ987690
Adria Lyra, Jérôme Monnot, Laurent Gourvès, Carlos A. Martinhon
Publication date: 13 August 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.03.009
Related Items (16)
Parameterized complexity of the MinCCA problem on graphs of bounded decomposability ⋮ Alternating-pancyclism in 2-edge-colored graphs ⋮ The quadratic cycle cover problem: special cases and efficient bounds ⋮ Parameterized complexity of finding a spanning tree with minimum reload cost diameter ⋮ The symmetric quadratic traveling salesman problem ⋮ Quadratic Combinatorial Optimization Using Separable Underestimators ⋮ On the complexity of constructing minimum changeover cost arborescences ⋮ On minimum reload cost cycle cover ⋮ The quadratic shortest path problem: complexity, approximability, and solution methods ⋮ A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs ⋮ Constructing minimum changeover cost arborescenses in bounded treewidth graphs ⋮ Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure ⋮ Minimum reload cost graph factors ⋮ Unnamed Item ⋮ Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs ⋮ Paths and trails in edge-colored weighted graphs
Cites Work
This page was built for publication: The minimum reload \(s-t\) path, trail and walk problems
