The minimum reload s-t path, trail and walk problems

DOI10.1016/J.DAM.2010.03.009zbMATH Open1209.05131OpenAlexW2056455157MaRDI QIDQ987690FDOQ987690

Authors: Laurent Gourvès, Adria Lyra, Jérôme Monnot, Carlos 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

Recommendations

• The Minimum Reload s-t Path/Trail/Walk Problems
• On minimum reload cost paths, tours, and flows
• Minimum-link paths revisited
• On the complexity of minimum-link path problems
• scientific article
• Min-sum 2-paths problems
• Min-sum 2-paths problems
• On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems
• On finding Min-Min disjoint paths
• MIN-MAX quickest path problems

zbMATH Keywords

TSPinapproximabilityNP-hardnessedge-colored graphspaths, trails and walksreload optimization

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On minimum reload cost paths, tours, and flows
• The complexity of a minimum reload cost diameter problem
• Reload cost trees and network design
• Reload cost problems: Minimum diameter spanning tree
• Paths and trails in edge-colored graphs

Cited In (18)

• On minimum reload cost paths, tours, and flows
• Paths and trails in edge-colored weighted graphs
• The quadratic shortest path problem: complexity, approximability, and solution methods
• Constructing minimum changeover cost arborescenses in bounded treewidth graphs
• Title not available (Why is that?)
• Alternating-pancyclism in 2-edge-colored graphs
• On minimum reload cost cycle cover
• Parameterized complexity of finding a spanning tree with minimum reload cost diameter
• Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs
• Parameterized complexity of the MinCCA problem on graphs of bounded decomposability
• On the complexity of constructing minimum changeover cost arborescences
• The Minimum Reload s-t Path/Trail/Walk Problems
• Minimum reload cost graph factors
• Quadratic Combinatorial Optimization Using Separable Underestimators
• The quadratic cycle cover problem: special cases and efficient bounds
• Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure
• A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs
• The symmetric quadratic traveling salesman problem

This page was built for publication: The minimum reload \(s-t\) path, trail and walk problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987690)