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

DOI10.1016/S0377-2217(97)00401-3MaRDI QIDQ1806678zbMATH OpenOpenAlexFDO

Authors Ali Amiri, Erik Rolland, Reza Barkhi

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

heuristicscall routingLagrangean relaxationtelecommunications networksbandwidth packing problemsub-gradient search

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Recommendations

• Queueing delay guarantees in bandwidth packing
• The multi-hour bandwidth packing problem
• Bandwidth packing problem with queueing delays: modelling and exact solution approach
• The combinatorial bandwidth packing problem
• Bandwidth packing with priority classes

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3562235 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3282977 (Why is no real title available?)
• A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
• An Integer Programming Approach to the Bandwidth Packing Problem
• Bandwidth Packing: A Tabu Search Approach
• Path assignment for call routing: An application of tabu search
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Validation of subgradient optimization

Cited in

(13)

• The invisible‐hand heuristic for origin‐destination integer multicommodity network flows
• Fractional 0-1 programming: applications and algorithms
• Bandwidth packing problem with queueing delays: modelling and exact solution approach
• Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees
• Multicommodity information flow through quantum annealer
• A cutting plane approach to combinatorial bandwidth packing problem with queuing delays
• The combinatorial bandwidth packing problem
• Fractional 0-1 programming and submodularity
• Bandwidth packing with priority classes
• A bundle-type algorithm for routing in telecommunication data networks
• The multi-hour bandwidth packing problem
• A branch and price approach for the robust bandwidth packing problem with queuing delays
• The selection and scheduling of telecommunication calls with time windows

Describes a project that uses

Uses Software

• Tabu search

This page was built for publication: Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures

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