A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
From MaRDI portal
Publication:4347283
DOI10.1002/(SICI)1097-0037(199705)29:3%3C161::AID-NET4%3E3.0.CO;2-FzbMATH Open0874.68243OpenAlexW2006935476MaRDI QIDQ4347283FDOQ4347283
Authors: Y. M. Sharaiha, Michel Gendreau, G. Laporte, Ibrahim. H Osman 
Publication date: 18 September 1997
Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199705)29:3%3C161::aid-net4%3E3.0.co;2-f
Recommendations
- A tabu search heuristic for the generalized minimum spanning tree problem
- scientific article; zbMATH DE number 2090612
- A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
- A simple enhancement of the Esau–Williams heuristic for the capacitated minimum spanning tree problem
- Building a capacitated minimum spanning tree using simulated annealing
Cited In (23)
- RAMP for the capacitated minimum spanning tree problem
- 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
- A branch-and-price-and-cut algorithm for the cable-routing problem in solar power plants
- Heuristic procedure neural networks for the CMST problem
- Heuristic and exact algorithms for the spanning tree detection problem
- An exact algorithm for the capacitated shortest spanning arborescence
- Title not available (Why is that?)
- A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
- Ejection chain and filter-and-fan methods in combinatorial optimization
- Tabu Search and Ejection Chains—Application to a Node Weighted Version of the Cardinality-Constrained TSP
- GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem
- Ejection chain and filter-and-fan methods in combinatorial optimization
- Survivable network design: the capacitated minimum spanning network problem
- Enhanced second order algorithm applied to the capacitated minimum spanning tree problem
- A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
- Digital data networks design using genetic algorithms
- Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem
- Tabu Search Algorithm Based on Strategic Oscillation for Nonlinear Minimum Spanning Tree Problems
- Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
- The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
- A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
- Design of capacitated degree constrained min-sum arborescence
This page was built for publication: A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4347283)
