A cutting plane approach to combinatorial bandwidth packing problem with queuing delays

DOI10.1007/s11590-016-1005-9zbMath1373.90128OpenAlexW2337452372MaRDI QIDQ2361145

Sachin Jayaswal, Navneet Vidyarthi, Sagnik Das

Publication date: 29 June 2017

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-016-1005-9

zbMATH Keywords

queueinginteger programmingOR in telecommunicationsbandwidth packingcutting plane algorithm

Mathematics Subject Classification ID

Integer programming (90C10) Queues and service in operations research (90B22) Combinatorial optimization (90C27)

Related Items

Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees, Alternate second order conic program reformulations for hub location under stochastic demand and congestion, Alternate solution approaches for competitive hub location problems, Conic programming models for production planning with clearing functions: formulations and duality

Uses Software

• Tabu search

Cites Work

• Bandwidth packing problem with queueing delays: modelling and exact solution approach
• The combinatorial bandwidth packing problem
• Exact solution of a class of nonlinear knapsack problems
• Bandwidth packing with priority classes
• Queueing delay guarantees in bandwidth packing
• Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures
• The multi-hour bandwidth packing problem
• Path assignment for call routing: An application of tabu search
• The selection and scheduling of telecommunication calls with time windows
• Bandwidth Packing: A Tabu Search Approach
• An Integer Programming Approach to the Bandwidth Packing Problem