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

DOI10.1016/j.cor.2023.106374OpenAlexW4385697044MaRDI QIDQ6068703

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

integer programmingsubmodular functionrobust optimizationbandwidth packing problemqueuing delays

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

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

Cites Work

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

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