On minimum reload cost cycle cover

DOI10.1016/J.ENDM.2010.05.011MaRDI QIDQ2883554zbMATH OpenOpenAlexFDO

Authors Giulia Galbiati, Stefano Gualandi, Francesco Maffioli

Publication date 13 May 2012

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2010.05.011

zbMATH Keywords

computational complexitynetwork optimizationreload cost model

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Recommendations

• On minimum reload cost cycle cover
• Minimum reload cost cycle cover in complete graphs
• Reload cost problems: Minimum diameter spanning tree

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On minimum reload cost paths, tours, and flows
• Reload cost problems: Minimum diameter spanning tree
• Reload cost trees and network design
• The Minimum Reload s-t Path/Trail/Walk Problems
• The complexity of a minimum reload cost diameter problem

Cited in

(4)

• The symmetric quadratic traveling salesman problem
• The rainbow cycle cover problem
• On minimum reload cost cycle cover
• Minimum reload cost cycle cover in complete graphs

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

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