A branch and price approach for the robust bandwidth packing problem with queuing delays

DOI10.1007/S10479-021-04292-WMaRDI QIDQ2070728zbMATH OpenOpenAlexFDO

Authors Seohee Kim, Chungmok Lee

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

zbMATH Keywords

bandwidth packing problembranch-and-priceknapsack problemqueuing delayrobust optimization

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic network models in operations research (90B10) Communication networks in operations research (90B18) Queues and service in operations research (90B22) Integer programming (90C10) Combinatorial optimization (90C27) Nonlinear programming (90C30)

Recommendations

• A cutting plane approach to combinatorial bandwidth packing problem with queuing delays
• Bandwidth packing problem with queueing delays: modelling and exact solution approach
• Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures
• Queueing delay guarantees in bandwidth packing
• An Integer Programming Approach to the Bandwidth Packing Problem

Cites work

• A robust approach to the chance-constrained knapsack problem
• A Robust Optimization Approach to Inventory Theory
• An Integer Programming Approach to the Bandwidth Packing Problem
• Backbone Network Design Tools with Economic Tradeoffs
• Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures
• Bandwidth Packing: A Tabu Search Approach
• Benders decomposition approach for the robust network design problem with flow bifurcations
• Cover inequalities for robust knapsack sets -- application to the robust bandwidth packing problem
• Exact solution of a class of nonlinear knapsack problems
• Exact solution of the robust knapsack problem
• Network flows. Theory, algorithms, and applications.
• Path assignment for call routing: An application of tabu search
• Recent advancements in robust optimization for investment management
• Technical note: Branch-and-price-and-cut approach to the robust network design problem without flow bifurcations
• The Price of Robustness

Cited in

(4)

• A cutting plane approach to combinatorial bandwidth packing problem with queuing delays
• Bandwidth packing problem with queueing delays: modelling and exact solution approach
• Cutting and packing problems under uncertainty: literature review and classification framework
• Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees

Describes a project that uses

Uses Software

• Tabu search

This page was built for publication: A branch and price approach for the robust bandwidth packing problem with queuing delays

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