A branch and bound algorithm for the capacitated minimum spanning tree problem

DOI10.1002/net.3230230603zbMath0793.90090OpenAlexW2124540286MaRDI QIDQ3141109

Kavindra Malik, Gang Yu

Publication date: 16 August 1994

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230230603

zbMATH Keywords

centervehicle routingLagrangean relaxationbranch and boundnetwork designundirected graphcapacitated minimum spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Transportation, logistics and supply chain management (90B06)

Related Items

Unnamed Item, An exact algorithm for the capacitated shortest spanning arborescence, RAMP for the capacitated minimum spanning tree problem, Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation, A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants, Hybrid fiber co-axial CATV network design with variable capacity optical network units

Cites Work

• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem