Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees

DOI10.1016/J.COR.2023.106374MaRDI QIDQ6068703zbMATH OpenOpenAlexFDO

Authors Seulgi Joung

Publication date 13 November 2023

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2023.106374

zbMATH Keywords

bandwidth packing probleminteger programmingqueuing delaysrobust optimizationsubmodular function

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A branch and price approach for the robust bandwidth packing problem with queuing delays
• A cutting plane approach to combinatorial bandwidth packing problem with queuing delays
• A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
• An Integer Programming Approach to the Bandwidth Packing Problem
• Bandwidth packing problem with queueing delays: modelling and exact solution approach
• Bandwidth packing with priority classes
• Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures
• Bandwidth Packing: A Tabu Search Approach
• Constructing uncertainty sets for robust linear optimization
• Cover inequalities for robust knapsack sets -- application to the robust bandwidth packing problem
• Exact solution of a class of nonlinear knapsack problems
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 1953186 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Lifting and separation of robust cover inequalities
• Network design with probabilistic capacities
• Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
• Polymatroids and mean-risk minimization in discrete optimization
• Queueing delay guarantees in bandwidth packing
• Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity
• Robust solutions of uncertain linear programs
• Submodularity in Conic Quadratic Mixed 0–1 Optimization
• The combinatorial bandwidth packing problem
• The multi-hour bandwidth packing problem
• The Price of Robustness

Cited in

(1)

• Improved approximation algorithms for \(k\)-submodular maximization under a knapsack constraint

This page was built for publication: Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees

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