The multi-hour bandwidth packing problem

DOI10.1016/S0305-0548(99)00004-0MaRDI QIDQ1818564zbMATH OpenFDO

Authors Ali Amiri, Reza Barkhi

Publication date 15 February 2000

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0305-0548(99)00004-0

zbMATH Keywords

bandwidth packingheuristicsinteger programmingLagrangean relaxationmulti-hour bandwidth packingtelecommunications networkstime-varying traffic

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Integer programming (90C10)

Recommendations

• Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures
• The combinatorial bandwidth packing problem
• An Integer Programming Approach to the Bandwidth Packing Problem
• The selection and scheduling of telecommunication calls with time windows
• Bandwidth packing with priority classes

Cited in

(13)

• Queueing delay guarantees in bandwidth packing
• Approximation algorithms and relaxations for a service provision problem on a telecommunication network
• Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures
• A cutting plane approach to combinatorial bandwidth packing problem with queuing delays
• The selection and scheduling of telecommunication calls with time windows
• Bandwidth packing problem with queueing delays: modelling and exact solution approach
• Bandwidth Packing: A Tabu Search Approach
• An Integer Programming Approach to the Bandwidth Packing Problem
• 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
• Multicommodity information flow through quantum annealer
• Bandwidth packing with priority classes

This page was built for publication: The multi-hour bandwidth packing problem

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