A tabu search algorithm for the routing and capacity assignment problem in computer networks
From MaRDI portal
(Redirected from Publication:1781553)
Recommendations
- Tabu search for a network loading problem with multiple facilities
- A tabu search algorithm for frequency assignment
- Least-cost network topology design for a new service: An application of tabu search
- A tabu search algorithm for the optimisation of telecommunication networks
- scientific article; zbMATH DE number 1054942
Cites work
- A delay dependent queue discipline
- A genetic algorithm for the weight setting problem in OSPF routing
- A heuristic for the continuous capacity and flow assignment
- A novel metaheuristics approach for continuous global optimization
- A tabu search algorithm for the optimisation of telecommunication networks
- Applying tabu search to the job-shop scheduling problem
- Backbone Network Design Tools with Economic Tradeoffs
- Bandwidth Packing: A Tabu Search Approach
- Capacity and flow assignment of data networks by generalized Benders decomposition
- Continuous Models for Capacity Design of Large Packet-Switched Telecommunication Networks
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Future paths for integer programming and links to artificial intelligence
- scientific article; zbMATH DE number 3522951 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- Metaheuristics: A bibliography
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- Optimizing the system of virtual paths by tabu search.
- Routing and capacity assignment in backbone communication networks
- Routing and capacity assignment in backbone communication networks under time varying traffic conditions
- Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
- Solution of the cumulative assignment problem with a well-structured tabu search method
- Tabu search for a network loading problem with multiple facilities
- Tabu Search—Part I
- Tabu Search—Part II
- The flow deviation method: An approach to store‐and‐forward communication network design
- The Reactive Tabu Search
- Topological expansion of multiple-ring metropolitan area networks
- Using tabu search techniques for graph coloring
Cited in
(9)- Least-cost network topology design for a new service: An application of tabu search
- Applying tabu search to spare capacity planning for network restoration
- A tabu search algorithm for the network pricing problem
- scientific article; zbMATH DE number 484567 (Why is no real title available?)
- scientific article; zbMATH DE number 1054942 (Why is no real title available?)
- Tabu search for a network loading problem with multiple facilities
- Two-level evolutionary approach to the survivable mesh-based transport network topological design
- A deterministic tabu search algorithm for the capacitated arc routing problem
- A tabu search algorithm for the global planning problem of third generation mobile networks
This page was built for publication: A tabu search algorithm for the routing and capacity assignment problem in computer networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781553)