Path assignment for call routing: An application of tabu search

DOI10.1007/BF02022997MaRDI QIDQ2367008zbMATH OpenOpenAlexFDO

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

Publication date 16 August 1993

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

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

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Transportation, logistics and supply chain management (90B06) Communication networks in operations research (90B18)

Cites work

• Finding the K Shortest Loopless Paths in a Network
• scientific article; zbMATH DE number 30947 (Why is no real title available?)

Cited in

(14)

• A simple tabu search method to solve the mixed-integer linear bilevel programming problem
• Genetic algorithms and tabu search: Hybrids for optimization
• Digital data networks design using genetic algorithms
• Applying tabu search to backup path planning for multicast networks
• Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures
• Metaheuristics: A bibliography
• A branch and price approach for the robust bandwidth packing problem with queuing delays
• A cutting plane approach to combinatorial bandwidth packing problem with queuing delays
• The selection and scheduling of telecommunication calls with time windows
• On the minimum cost multiple-source unsplittable flow problem
• Bandwidth packing problem with queueing delays: modelling and exact solution approach
• Optimizing the system of virtual paths by tabu search.
• The combinatorial bandwidth packing problem
• Bandwidth packing with priority classes

Describes a project that uses

Uses Software

• Tabu search

This page was built for publication: Path assignment for call routing: An application of tabu search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367008)