On minimum reload cost cycle cover
type: Item
instance of: scholarly article
title: On minimum reload cost cycle cover
zbMATH Open document ID: 1321.05083
author: Giulia Galbiati
author: Francesco Maffioli
author: Stefano Gualandi
published in: Discrete Applied Mathematics
publication date: 2015-09-22T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 05C82
zbMATH DE Number: 6484184
zbMATH Keywords: network optimization
zbMATH Keywords: reload cost model
zbMATH Keywords: computational complexity
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: j.dam.2011.12.006
OpenAlex ID: W2172501715
cites work: On minimum reload cost paths, tours, and flows
cites work: Computational complexity of some restricted instances of 3-SAT
cites work: Q4398864
cites work: Q3267900
cites work: The complexity of a minimum reload cost diameter problem
cites work: Reload cost trees and network design
cites work: Q4198056
cites work: The minimum reload \(s-t\) path, trail and walk problems
cites work: Selected Topics in Column Generation
cites work: Reload cost problems: Minimum diameter spanning tree
DOI: 10.1016/J.DAM.2011.12.006
Recommended article: On minimum reload cost cycle cover
Recommended article: Minimum reload cost cycle cover in complete graphs
Recommended article: Minimum reload cost graph factors
Recommended article: Minimum Covering with Travel Cost
Recommended article: Minimum covering with travel cost
Recommended article: The complexity of a minimum reload cost diameter problem
Recommended article: On minimum reload cost paths, tours, and flows
Recommended article: Minimum cost flows with minimum quantities
Recommended article: Minimum maximum reconfiguration cost problem
description: scientific article; zbMATH DE number 6484184