Minimal cost linkages in graphs

DOI10.1023/A:1018963020368zbMATH Open0921.90140MaRDI QIDQ1290153FDOQ1290153

Authors: S. A. Harrison, V. J. Rayward-Smith 

Publication date: 10 June 1999

Published in: Annals of Operations Research (Search for Journal in Brave)

Recommendations

• Two algorithms for the subset interconnection design problem
• The 2-path network problem
• Generalized steiner problem in series-parallel networks
• Minimum cost path problems with relays

zbMATH Keywords

simulated annealinggenetic algorithmsNP-completenessmin-max non-intersecting pathsmin-sum non-intersecting pathsminimal cost linkages

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cited In (4)

• Combining regression and mixed-integer programming to model counterinsurgency
• Link-Length Minimization in Networks
• Minimum-link paths revisited
• Computational complexity of convoy movement planning problems

This page was built for publication: Minimal cost linkages in graphs

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