Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem

DOI10.1287/ijoc.8.3.219zbMath0871.90032OpenAlexW2064806410MaRDI QIDQ5690262

Leslie A. Hall

Publication date: 9 October 1997

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.8.3.219

zbMATH Keywords

vehicle routingbranch-and-cuttelecommunications network designcutting plane algorithmcapacitated centralized processing networkcapacitated spanning tree problemgeneral-demand case

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Transportation, logistics and supply chain management (90B06)

Related Items

Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem, The capacitated minimum spanning tree problem: On improved multistar constraints, Unnamed Item, A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem, A biased random-key genetic algorithm for the capacitated minimum spanning tree problem, Enhanced second order algorithm applied to the capacitated minimum spanning tree problem, Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route, RAMP for the capacitated minimum spanning tree problem, Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs, Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation, The capacitated minimum spanning tree problem: revisiting hop-indexed formulations, GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem, 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, Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees, Heuristic procedure neural networks for the CMST problem, Design of capacitated degree constrained min-sum arborescence, Savings based ant colony optimization for the capacitated minimum spanning tree problem