On minimum reload cost cycle cover

DOI10.1016/j.dam.2011.12.006zbMath1321.05083OpenAlexW2172501715MaRDI QIDQ496639

Francesco Maffioli, Giulia Galbiati, Stefano Gualandi

Publication date: 22 September 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.12.006

zbMATH Keywords

computational complexitynetwork optimizationreload cost model

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (max. 100)

Minimization and maximization versions of the quadratic travelling salesman problem ⋮ Lower bounding procedure for the asymmetric quadratic traveling salesman problem ⋮ Parameterized complexity of the MinCCA problem on graphs of bounded decomposability ⋮ SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning ⋮ The quadratic cycle cover problem: special cases and efficient bounds ⋮ Parameterized complexity of finding a spanning tree with minimum reload cost diameter ⋮ On the complexity of constructing minimum changeover cost arborescences ⋮ 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 ⋮ On Solving the Quadratic Shortest Path Problem ⋮ Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational complexity of some restricted instances of 3-SAT
• The minimum reload \(s-t\) path, trail and walk problems
• The complexity of a minimum reload cost diameter problem
• Reload cost trees and network design
• On minimum reload cost paths, tours, and flows
• Selected Topics in Column Generation
• Reload cost problems: Minimum diameter spanning tree

This page was built for publication: On minimum reload cost cycle cover