Bandwidth packing problem with queueing delays: modelling and exact solution approach

DOI10.1007/s10898-015-0399-8zbMath1353.90092OpenAlexW2284367939MaRDI QIDQ312479

Navneet Vidyarthi, Vikranth Babu Tirumala Chetty, Sachin Jayaswal

Publication date: 15 September 2016

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-015-0399-8

zbMATH Keywords

integer programmingtelecommunicationsconstraint generationbandwidth packingcall routingfinite linearizationqueuing delay

Mathematics Subject Classification ID

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

Related Items (4)

A cutting plane approach to combinatorial bandwidth packing problem with queuing delays ⋮ 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

Uses Software

• Tabu search

Cites Work

• 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

This page was built for publication: Bandwidth packing problem with queueing delays: modelling and exact solution approach