A branch and price approach for the robust bandwidth packing problem with queuing delays
From MaRDI portal
Publication:2070728
DOI10.1007/s10479-021-04292-wzbMath1481.90105OpenAlexW2774816358MaRDI QIDQ2070728
Publication date: 24 January 2022
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-021-04292-w
Integer programming (90C10) Nonlinear programming (90C30) Communication networks in operations research (90B18) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Cutting and packing problems under uncertainty: literature review and classification framework, Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees
Uses Software
Cites Work
- Unnamed Item
- Exact solution of the robust knapsack problem
- Exact solution of a class of nonlinear knapsack problems
- A robust approach to the chance-constrained knapsack problem
- Recent advancements in robust optimization for investment management
- Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures
- Path assignment for call routing: An application of tabu search
- Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem
- A Robust Optimization Approach to Inventory Theory
- The Price of Robustness
- Backbone Network Design Tools with Economic Tradeoffs
- Bandwidth Packing: A Tabu Search Approach
- An Integer Programming Approach to the Bandwidth Packing Problem
- Technical Note—Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations
- Benders decomposition approach for the robust network design problem with flow bifurcations
