A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.

DOI10.1016/S0167-6377(02)00236-5zbMath1064.90039OpenAlexW2075677840WikidataQ59592530 ScholiaQ59592530MaRDI QIDQ1811625

James B. Orlin, Ravindra K. Ahuja, Dushyant Sharma

Publication date: 17 June 2003

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(02)00236-5

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Combinatorial optimization (90C27)

Related Items

Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem, A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem, A biased random-key genetic algorithm for the capacitated minimum spanning tree problem, Survivable network design: the capacitated minimum spanning network problem, The multimode covering location problem, Enhanced second order algorithm applied to the capacitated minimum spanning tree problem, RAMP for the capacitated minimum spanning tree problem, Constraint-based very large-scale neighborhood search, LS(graph): a constraint-based local search for constraint optimization on trees and paths, Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling, Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation, Ejection chain and filter-and-fan methods in combinatorial optimization, Ejection chain and filter-and-fan methods in combinatorial optimization, Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem, Further extension of the TSP assign neighborhood, Algorithms for the design of network topologies with balanced disjoint rings, A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning, Design of capacitated degree constrained min-sum arborescence, An integrated inventory-routing system for multi-item joint replenishment with limited vehicle capacity, Savings based ant colony optimization for the capacitated minimum spanning tree problem

Uses Software

• GRASP
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Topological design of telecommunication networks --- local access design methods
• The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
• Greedy randomized adaptive search procedures
• Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
• A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
• Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem