The selection and scheduling of telecommunication calls with time windows

DOI10.1016/J.EJOR.2004.02.026MaRDI QIDQ2484356zbMATH OpenOpenAlexFDO

Authors Ali Amiri

Publication date 1 August 2005

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

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

zbMATH Keywords

Bandwidth packingInteger programmingLagrangean relaxationSchedulingTelecommunications

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Recommendations

• The multi-hour bandwidth packing problem
• Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures
• An Integer Programming Approach to the Bandwidth Packing Problem
• The combinatorial bandwidth packing problem
• Queueing delay guarantees in bandwidth packing

Cites work

• A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
• An Integer Programming Approach to the Bandwidth Packing Problem
• Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures
• Bandwidth Packing: A Tabu Search Approach
• scientific article; zbMATH DE number 3918092 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• scientific article; zbMATH DE number 1349588 (Why is no real title available?)
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Path assignment for call routing: An application of tabu search
• Queueing delay guarantees in bandwidth packing
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• The multi-hour bandwidth packing problem
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II

Cited in

(7)

• Scheduling installations in the telecommunications industry
• The multi-hour bandwidth packing problem
• Shortest path problems with left-side time windows
• A cutting plane approach to combinatorial bandwidth packing problem with queuing delays
• Bandwidth packing problem with queueing delays: modelling and exact solution approach
• The combinatorial bandwidth packing problem
• Bandwidth packing with priority classes

Describes a project that uses

Uses Software

• Tabu search

This page was built for publication: The selection and scheduling of telecommunication calls with time windows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484356)