Tabu search for a network loading problem with multiple facilities

DOI10.1023/A:1009679511137zbMath0969.68642OpenAlexW2137944694MaRDI QIDQ5938742

No author found.

Publication date: 1 October 2001

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

Full work available at URL: https://doi.org/10.1023/a:1009679511137

zbMATH Keywords

tabu search\(k\)-shortest pathsnetwork designtelecommunications

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (10)

Exact approaches to the single-source network loading problem ⋮ Making a state-of-the-art heuristic faster with data mining ⋮ A hybrid data mining GRASP with path-relinking ⋮ Metaheuristics: A Canadian Perspective ⋮ Adaptive memory in multistart heuristics for multicommodity network design ⋮ A MIP-based approach to solve the prize-collecting local access network design problem ⋮ GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem ⋮ A tabu search algorithm for the routing and capacity assignment problem in computer networks ⋮ 0-1 reformulations of the multicommodity capacitated network design problem ⋮ Diversification strategies in local search for a nonbifurcated network loading problem

This page was built for publication: Tabu search for a network loading problem with multiple facilities