Least-cost network topology design for a new service: An application of tabu search

DOI10.1007/BF02073940zbMath0736.90031OpenAlexW2922172396MaRDI QIDQ1179745

S. Singh

Publication date: 27 June 1992

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02073940

zbMATH Keywords

tabu searchlow-cost topology

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Communication networks in operations research (90B18) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (6)

A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods ⋮ A tabu search algorithm for frequency assignment ⋮ Metaheuristics: A bibliography ⋮ Adaptive Routing Algorithm in Wireless Communication Networks Using Evolutionary Algorithm ⋮ Digital data networks design using genetic algorithms ⋮ Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems

Cites Work

• Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
• The tabu search metaheuristic: How we used it
• Tabu Search—Part I

This page was built for publication: Least-cost network topology design for a new service: An application of tabu search