A branch and price approach for the robust bandwidth packing problem with queuing delays
type: Item
instance of: scholarly article
title: A branch and price approach for the robust bandwidth packing problem with queuing delays
zbMATH Open document ID: 1481.90105
author: Seohee Kim
author: Chungmok Lee
published in: Annals of Operations Research
publication date: 2022-01-24T00:00:00Z
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 7462454
zbMATH Keywords: bandwidth packing problem
zbMATH Keywords: branch-and-price
zbMATH Keywords: robust optimization
zbMATH Keywords: queuing delay
zbMATH Keywords: knapsack problem
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: s10479-021-04292-w
OpenAlex ID: W2774816358
cites work: Q3056948
cites work: Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures
cites work: Path assignment for call routing: An application of tabu search
cites work: The Price of Robustness
cites work: A Robust Optimization Approach to Inventory Theory
cites work: Exact solution of a class of nonlinear knapsack problems
cites work: Backbone Network Design Tools with Economic Tradeoffs
cites work: Recent advancements in robust optimization for investment management
cites work: A robust approach to the chance-constrained knapsack problem
cites work: Cover inequalities for robust knapsack sets -- application to the robust bandwidth packing problem
cites work: Bandwidth Packing: A Tabu Search Approach
cites work: Technical Note—Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations
cites work: Benders decomposition approach for the robust network design problem with flow bifurcations
cites work: Exact solution of the robust knapsack problem
cites work: An Integer Programming Approach to the Bandwidth Packing Problem
DOI: 10.1007/S10479-021-04292-W
description: scientific article; zbMATH DE number 7462454