The capacitated minimum spanning tree problem: revisiting hop-indexed formulations

DOI10.1016/j.cor.2004.03.011zbMath1066.90102OpenAlexW2013912214MaRDI QIDQ1772873

Luís Gouveia, Pedro Martins

Publication date: 21 April 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2004.03.011

zbMATH Keywords

Capacitated spanning treesCutting plane algorithmsGeneralized subtour elimination constraintsHop-indexed formulations

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

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, Enhanced second order algorithm applied to the capacitated minimum spanning tree problem, A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks, Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation, 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

Cites Work

• The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
• A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem
• The complexity of the capacitated tree problem
• A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
• Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem
• Unnamed Item
• Unnamed Item