GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem

DOI10.1007/s10732-008-9079-xzbMath1176.90073OpenAlexW2160313266MaRDI QIDQ2271122

Túlio A. M. Toffolo, Mauricio C. de Souza, Alexandre Xavier Martins, Marcone Jamilson Freitas Souza

Publication date: 6 August 2009

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-008-9079-x

zbMATH Keywords

GRASPlocal searchnetwork designsubproblem optimizationmulti-level capacitated minimum spanning tree problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (4)

Integer programming techniques for the nurse rostering problem ⋮ Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem ⋮ Heuristics for the multi-level capacitated minimum spanning tree problem ⋮ A hybrid VNS algorithm for solving the multi-level capacitated minimum spanning tree problem

Uses Software

• GRASP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enhanced second order algorithm applied to the capacitated minimum spanning tree problem
• Topological design of telecommunication networks --- local access design methods
• The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
• Greedy randomized adaptive search procedures
• Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
• The Multilevel Capacitated Minimum Spanning Tree Problem
• An annotated bibliography of GRASP – Part I: Algorithms
• An Oil Pipeline Design Problem
• The complexity of the capacitated tree problem
• Topological design of centralized computer networks—formulations and algorithms
• A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
• A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
• The One-Terminal TELPAK Problem
• Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem
• Tabu search for a network loading problem with multiple facilities
• Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem

This page was built for publication: GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem