The combinatorial bandwidth packing problem

DOI10.1016/j.ejor.2010.08.005zbMath1206.90020OpenAlexW2070062720MaRDI QIDQ621657

Ali Amiri, Reza Barkhi

Publication date: 28 January 2011

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.08.005

zbMATH Keywords

integer programmingLagrangean relaxationtelecommunicationsbandwidth packing

Mathematics Subject Classification ID

Integer programming (90C10) Communication networks in operations research (90B18)

Related Items (4)

Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem ⋮ A cutting plane approach to combinatorial bandwidth packing problem with queuing delays ⋮ Bandwidth packing problem with queueing delays: modelling and exact solution approach ⋮ Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees

Uses Software

• CPLEX
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Bandwidth Packing: A Tabu Search Approach
• An Integer Programming Approach to the Bandwidth Packing Problem
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II

This page was built for publication: The combinatorial bandwidth packing problem