scientific article; zbMATH DE number 1420487

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(200001)35:1<1::AID-NET1>3.0.CO;2-L" /><1::AID-NET1>3.0.CO;2-L 10.1002/(SICI)1097-0037(200001)35:1<1::AID-NET1>3.0.CO;2-LzbMath0938.90067MaRDI QIDQ4944737

Luís Gouveia, Pedro Martins

Publication date: 27 June 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

linear programmingcapacitated minimum spanning tree problemhop-indexed flow model

Mathematics Subject Classification ID

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

Related Items (14)

Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem ⋮ The capacitated minimum spanning tree problem: On improved multistar constraints ⋮ A hybrid evolutionary algorithm for the 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 ⋮ Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation ⋮ Combined route capacity and route length models for unit demand vehicle routing problems ⋮ The capacitated minimum spanning tree problem: revisiting hop-indexed formulations ⋮ GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem ⋮ 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. ⋮ Survey on path and cycle embedding in some networks ⋮ Design of capacitated degree constrained min-sum arborescence ⋮ Savings based ant colony optimization for the capacitated minimum spanning tree problem

Cites Work

• The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
• An exact algorithm for the capacitated shortest spanning arborescence
• A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem
• A branch and bound algorithm for the capacitated minimum spanning tree problem
• Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
• Topological design of centralized computer networks—formulations and algorithms
• A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
• Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
• 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

This page was built for publication: