The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
From MaRDI portal
Publication:1290151
DOI10.1023/A:1018911003529zbMath0921.90141OpenAlexW2084863329MaRDI QIDQ1290151
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
Related Items
Unnamed Item, Layered graph models and exact algorithms for the generalized hop-constrained 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, Cost additive rules in minimum cost spanning tree problems with multiple sources, Combined route capacity and route length models for unit demand vehicle routing problems, The capacitated minimum spanning tree problem: revisiting hop-indexed formulations, The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach, A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem, A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem., A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants, 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
