Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Route selection in backbone data communication networks
Computer Networks and ISDN Systems
Annals of Operations Research
Bandwidth packing: a tabu search approach
Management Science
Applying tabu search to the job-shop scheduling problem
Annals of Operations Research - Special issue on Tabu search
Routing and capacity assignment in backbone communication networks
Computers and Operations Research
A Methodology for Network Topology Design with Link and Node Failures Tolerance
International Journal of Network Management
Design and Analysis of Computer Communication Networks
Design and Analysis of Computer Communication Networks
Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Solution of the Cumulative Assignment Problem With a Well-Structured TabuSearch Method
Journal of Heuristics
Tabu Search for a Network Loading Problem with Multiple Facilities
Journal of Heuristics
Cooperative Parallel Tabu Search for Capacitated Network Design
Journal of Heuristics
Capacity and flow assignment of data networks by generalized Benders decomposition
Journal of Global Optimization
A novel metaheuristics approach for continuous global optimization
Journal of Global Optimization
Sequential and Parallel Approaches to IncorporateReliability in the Synthesis of Computer Networks
Journal of Network and Systems Management
The design of store-and-forward (s/f) networks for computer communications
The design of store-and-forward (s/f) networks for computer communications
Communication nets; stochastic message flow and delay
Communication nets; stochastic message flow and delay
A system for the design of packet-switched communication networks with economic tradeoffs
Computer Communications
Computers and Industrial Engineering
Journal of Network and Systems Management
Hi-index | 0.01 |
A tabu search metaheuristic algorithm for a classical routing and capacity assignment (CFA) problem in computer networks is presented in this paper. Computational experiments across a variety of networks are reported. The results show that the proposed tabu search algorithm is both effective and efficient in finding good solutions of the CFA problem compared with the traditional Lagrangean relaxation and subgradient optimization technique. Extensive tests are made in order to choose the best values of the parameters for tabu search algorithm.