Bandwidth packing with priority classes

DOI10.1016/j.ejor.2007.09.011zbMath1179.90044OpenAlexW1963906273MaRDI QIDQ948674

Indranil Bose

Publication date: 17 October 2008

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.09.011

zbMATH Keywords

integer programmingLagrangean relaxationOR in telecommunicationsbandwidth packingpriority classes

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic network models in operations research (90B10)

Related Items (4)

A cutting plane approach to combinatorial bandwidth packing problem with queuing delays ⋮ Bandwidth packing problem with queueing delays: modelling and exact solution approach ⋮ Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees ⋮ The combinatorial bandwidth packing problem

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
• Queueing delay guarantees in bandwidth packing
• Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures
• The multi-hour bandwidth packing problem
• Asynchronous transfer mode networks with parallel links and multiple service classes
• Path assignment for call routing: An application of tabu search
• The selection and scheduling of telecommunication calls with time windows
• Bandwidth Packing: A Tabu Search Approach
• An Integer Programming Approach to the Bandwidth Packing Problem
• ON THE STABILITY OF A BANDWIDTH PACKING ALGORITHM

This page was built for publication: Bandwidth packing with priority classes