Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures

DOI10.1016/S0377-2217(97)00401-3zbMath0933.90010OpenAlexW2071622420MaRDI QIDQ1806678

Reza Barkhi, Ali Amiri, Erik Rolland

Publication date: 4 April 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00401-3

zbMATH Keywords

heuristicsLagrangean relaxationcall routingtelecommunications networksbandwidth packing problemsub-gradient search

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items

A cutting plane approach to combinatorial bandwidth packing problem with queuing delays ⋮ Bandwidth packing problem with queueing delays: modelling and exact solution approach ⋮ Fractional 0-1 programming and submodularity ⋮ Fractional 0-1 programming: applications and algorithms ⋮ The invisible‐hand heuristic for origin‐destination integer multicommodity network flows ⋮ Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees ⋮ The combinatorial bandwidth packing problem ⋮ Bandwidth packing with priority classes ⋮ The selection and scheduling of telecommunication calls with time windows ⋮ A branch and price approach for the robust bandwidth packing problem with queuing delays

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
• Path assignment for call routing: An application of tabu search
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Bandwidth Packing: A Tabu Search Approach
• An Integer Programming Approach to the Bandwidth Packing Problem
• Validation of subgradient optimization