The capacitated minimal spanning tree problem: An experiment with a hop-indexed model

DOI10.1023/A:1018911003529MaRDI QIDQ1290151zbMATH OpenOpenAlexFDO

Authors Pedro Martins, Luis Gouveia

Publication date 10 June 1999

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

Full work available at URL https://doi.org/10.1023/a:1018911003529

zbMATH Keywords

capacitated minimal spanning treecutting plane methodhop-indexed single-commodity flow model

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 1420487
• The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
• A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
• The capacitated minimum spanning tree problem: On improved multistar constraints

Cited in

(27)

• A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem
• Designing reliable tree networks with two cable technologies
• 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
• A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
• The capacitated minimum spanning tree problem: On improved multistar constraints
• Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
• Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs
• A multiperiod planning model for the capacitated minimal spanning tree problem
• The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach
• Design of capacitated degree constrained min-sum arborescence
• Cost additive rules in minimum cost spanning tree problems with multiple sources
• 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
• Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
• The (K,k)-Capacitated Spanning Tree Problem
• scientific article; zbMATH DE number 1488100 (Why is no real title available?)
• A simple enhancement of the Esau–Williams heuristic for the capacitated minimum spanning tree problem
• Multistars and directed flow formulations
• A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
• 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
• Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem
• An extended formulation with valid inequalities for the capacitated Steiner arborescence problem
• Combined route capacity and route length models for unit demand vehicle routing problems

This page was built for publication: The capacitated minimal spanning tree problem: An experiment with a hop-indexed model

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