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

DOI10.1287/IJOC.8.3.219MaRDI QIDQ5690262zbMATH OpenOpenAlexFDO

Authors 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

branch-and-cutcapacitated centralized processing networkcapacitated spanning tree problemcutting plane algorithmgeneral-demand casetelecommunications network designvehicle routing

Mathematics Subject Classification ID

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

Recommendations

• The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
• Heuristics for the multi-level capacitated minimum spanning tree problem
• A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
• Capacitated Network Design—Polyhedral Structure and Computation
• scientific article; zbMATH DE number 2090612

Cited in

(21)

• 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
• The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
• The capacitated minimum spanning tree problem: On improved multistar constraints
• An exact algorithm for the capacitated shortest spanning arborescence
• Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs
• Design of capacitated degree constrained min-sum arborescence
• A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
• GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem
• 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
• Savings based ant colony optimization for the capacitated minimum spanning tree problem
• Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem
• A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
• scientific article; zbMATH DE number 3963210 (Why is no real title available?)
• scientific article; zbMATH DE number 1420487 (Why is no real title available?)
• A branch-and-price-and-cut algorithm for the cable-routing problem in solar power plants
• Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route
• Exact solution of the centralized network design problem on directed graphs
• Enhanced second order algorithm applied to the capacitated minimum spanning tree problem

This page was built for publication: Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem

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