Bandwidth packing problem with queueing delays: modelling and exact solution approach
From MaRDI portal
Recommendations
- Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures
- A cutting plane approach to combinatorial bandwidth packing problem with queuing delays
- Queueing delay guarantees in bandwidth packing
- A branch and price approach for the robust bandwidth packing problem with queuing delays
- The multi-hour bandwidth packing problem
Cites work
- An Integer Programming Approach to the Bandwidth Packing Problem
- Bandwidth Packing: A Tabu Search Approach
- Bandwidth packing with priority classes
- Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures
- Exact solution of a class of nonlinear knapsack problems
- Path assignment for call routing: An application of tabu search
- Queueing delay guarantees in bandwidth packing
- The combinatorial bandwidth packing problem
- The multi-hour bandwidth packing problem
- The selection and scheduling of telecommunication calls with time windows
Cited in
(5)- Alternate solution approaches for competitive hub location problems
- Alternate second order conic program reformulations for hub location under stochastic demand and congestion
- Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees
- A cutting plane approach to combinatorial bandwidth packing problem with queuing delays
- A branch and price approach for the robust bandwidth packing problem with queuing delays
This page was built for publication: Bandwidth packing problem with queueing delays: modelling and exact solution approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q312479)