Path assignment for call routing: An application of tabu search-Reference-Cited by-同舟云学术

Path assignment for call routing: An application of tabu search

Published:1993-12 Issue:4 Volume:41 Page:299-312
ISSN:0254-5330
Container-title:Annals of Operations Research
language:en
Short-container-title:Ann Oper Res

Author:

Anderson Charles A.,Fraughnaugh Kathryn,Parker Mark,Ryan Jennifer

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research,General Decision Sciences

Link

http://link.springer.com/content/pdf/10.1007/BF02022997.pdf

Reference8 articles.

1. L.A. Cox, L. Davis and Y. Qiu, Dynamic anticipatory routing in circuit-switched telecommunications networks, in:Handbook of Genetic Algorithms, ed. L. Davis (Van Nostrand/Reinhold, New York, 1991).

2. L. Davis, private communication.

3. F. Glover, Tabu search, Part I, ORSA J. Comput. 1(1989)190–206.

4. F. Glover, Tabu search, Part II, ORSA J. Comput. 2(1990)4–32.

5. F. Glover and M. Laguna, Tabu search for a scheduling problem, preprint.

Cited by 30 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Metaheuristic optimization techniques;Power System Fault Diagnosis;2022

2. A branch and price approach for the robust bandwidth packing problem with queuing delays;Annals of Operations Research;2021-09-29

3. Randomized rounding algorithms for large scale unsplittable flow problems;Journal of Heuristics;2021-09-09

4. A linear programming based heuristic algorithm for bandwidth packing problem with scheduling;Journal of the Operational Research Society;2019-02-15

5. Guided Local Search;Handbook of Heuristics;2018