Minimal cost linkages in graphs

DOI10.1023/A:1018963020368zbMath0921.90140MaRDI QIDQ1290153

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

Publication date: 10 June 1999

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

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)

Related Items (2)

Combining regression and mixed-integer programming to model counterinsurgency ⋮ Computational complexity of convoy movement planning problems

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