On Minimum Reload Cost Cycle Cover

DOI10.1016/j.endm.2010.05.011zbMath1237.90242OpenAlexW1981172318MaRDI QIDQ2883554

Francesco Maffioli, Stefano Gualandi, Giulia Galbiati

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)

Related Items (1)

The symmetric quadratic traveling salesman problem

Cites Work

• Unnamed Item
• The complexity of a minimum reload cost diameter problem
• Reload cost trees and network design
• On minimum reload cost paths, tours, and flows
• The Minimum Reload s-t Path/Trail/Walk Problems
• Reload cost problems: Minimum diameter spanning tree

This page was built for publication: On Minimum Reload Cost Cycle Cover