A tabu search algorithm for the routing and capacity assignment problem in computer networks
From MaRDI portal
Publication:1781553
DOI10.1016/j.cor.2004.04.004zbMath1071.90052OpenAlexW1995178812MaRDI QIDQ1781553
Peng Zheng, Fuyong Xu, Jian Shen
Publication date: 27 June 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.04.004
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using tabu search techniques for graph coloring
- Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
- Routing and capacity assignment in backbone communication networks
- A tabu search algorithm for the optimisation of telecommunication networks
- A genetic algorithm for the weight setting problem in OSPF routing
- Solution of the cumulative assignment problem with a well-structured tabu search method
- Future paths for integer programming and links to artificial intelligence
- Routing and capacity assignment in backbone communication networks under time varying traffic conditions
- A novel metaheuristics approach for continuous global optimization
- A heuristic for the continuous capacity and flow assignment
- Metaheuristics: A bibliography
- Applying tabu search to the job-shop scheduling problem
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- Tabu Search—Part I
- Continuous Models for Capacity Design of Large Packet-Switched Telecommunication Networks
- Tabu Search—Part II
- Backbone Network Design Tools with Economic Tradeoffs
- Bandwidth Packing: A Tabu Search Approach
- The Reactive Tabu Search
- Topological expansion of multiple-ring metropolitan area networks
- The flow deviation method: An approach to store‐and‐forward communication network design
- A delay dependent queue discipline
- Optimizing the system of virtual paths by tabu search.
- Tabu search for a network loading problem with multiple facilities
- Capacity and flow assignment of data networks by generalized Benders decomposition