The multi-hour bandwidth packing problem

DOI10.1016/S0305-0548(99)00004-0zbMath0935.90009MaRDI QIDQ1818564

Ali Amiri, Reza Barkhi

Publication date: 15 February 2000

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

heuristicsinteger programmingLagrangean relaxationbandwidth packingtelecommunications networksmulti-hour bandwidth packingtime-varying traffic

Mathematics Subject Classification ID

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

Related Items (7)

A cutting plane approach to combinatorial bandwidth packing problem with queuing delays ⋮ Bandwidth packing problem with queueing delays: modelling and exact solution approach ⋮ The invisible‐hand heuristic for origin‐destination integer multicommodity network flows ⋮ Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees ⋮ The combinatorial bandwidth packing problem ⋮ Bandwidth packing with priority classes ⋮ The selection and scheduling of telecommunication calls with time windows

This page was built for publication: The multi-hour bandwidth packing problem