Pages that link to "Item:Q621657"
From MaRDI portal
The following pages link to The combinatorial bandwidth packing problem (Q621657):
Displaying 13 items.
- The Bandwidth Allocation Problem in the ATM network model is NP-complete (Q293234) (← links)
- Bandwidth packing problem with queueing delays: modelling and exact solution approach (Q312479) (← links)
- Bandwidth packing with priority classes (Q948674) (← links)
- Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem (Q1615965) (← links)
- Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures (Q1806678) (← links)
- The multi-hour bandwidth packing problem (Q1818564) (← links)
- Bandwidth contrained NP-complete problems (Q1822500) (← links)
- A cutting plane approach to combinatorial bandwidth packing problem with queuing delays (Q2361145) (← links)
- The selection and scheduling of telecommunication calls with time windows (Q2484356) (← links)
- On rerouting connection requests in networks with shared bandwidth (Q2839218) (← links)
- Bandwidth Packing: A Tabu Search Approach (Q4202466) (← links)
- An Integer Programming Approach to the Bandwidth Packing Problem (Q4363676) (← links)
- Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees (Q6068703) (← links)