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

DOI10.1287/IJOC.8.3.219zbMATH Open0871.90032OpenAlexW2064806410MaRDI QIDQ5690262FDOQ5690262

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

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

zbMATH Keywords

branch-and-cutvehicle routingcutting plane algorithmtelecommunications network designcapacitated centralized processing networkcapacitated spanning tree problemgeneral-demand case

Mathematics Subject Classification ID

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

Cited In (21)

• 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
• A branch-and-price-and-cut algorithm for the cable-routing problem in solar power plants
• Heuristic procedure neural networks for the CMST problem
• An exact algorithm for the capacitated shortest spanning arborescence
• Hybrid fiber co-axial CATV network design with variable capacity optical network units
• Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs
• Title not available (Why is that?)
• A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
• Title not available (Why is that?)
• Exact solution of the centralized network design problem on directed graphs
• GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem
• Enhanced second order algorithm applied to the capacitated minimum spanning tree problem
• A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
• Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem
• Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
• The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
• The capacitated minimum spanning tree problem: On improved multistar constraints
• Design of capacitated degree constrained min-sum arborescence
• Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route

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)