On minimum reload cost cycle cover

DOI10.1016/J.ENDM.2010.05.011zbMATH Open1237.90242OpenAlexW1981172318MaRDI QIDQ2883554FDOQ2883554

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

Recommendations

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

zbMATH Keywords

computational complexitynetwork optimizationreload cost model

Mathematics Subject Classification ID

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

Cites Work

• 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
• The Minimum Reload s-t Path/Trail/Walk Problems

Cited In (2)

• On minimum reload cost cycle cover
• The symmetric quadratic traveling salesman problem

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)