scientific article; zbMATH DE number 1420487

DOI10.1002/(SICI)1097-0037(200001)35:1%3C1::AID-NET1%3E3.0.CO;2-LMaRDI QIDQ4944737zbMATH OpenFDO

Authors Luis Gouveia, Pedro Martins

Publication date 27 June 2000

zbMATH Keywords

linear programmingcapacitated minimum spanning tree problemhop-indexed flow model

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Trees (05C05)

Recommendations

• The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
• The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
• On formulations and methods for the hop-constrained minimum spanning tree problem
• A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
• New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints

Cites work

• A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
• A branch and bound algorithm for the capacitated minimum spanning tree problem
• A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem
• A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
• An exact algorithm for the capacitated shortest spanning arborescence
• Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
• The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
• Topological design of centralized computer networks—formulations and algorithms
• Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints

Cited in

(15)

• 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
• Survey on path and cycle embedding in some networks
• Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
• A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem
• A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
• 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
• Combined route capacity and route length models for unit demand vehicle routing problems
• 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
• Design of capacitated degree constrained min-sum arborescence

This page was built for publication:

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