An Integer Programming Approach to the Bandwidth Packing Problem

DOI10.1287/MNSC.42.9.1277MaRDI QIDQ4363676zbMATH OpenOpenAlexFDO

Authors Kyungchul Park, Seokhoon Kang, Sungsoo Park

Publication date 12 November 1997

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.42.9.1277

zbMATH Keywords

branch-and-cutbranch-and-boundbandwidth packingpolyhedral cutsarc-capacitated network

Mathematics Subject Classification ID

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

Recommendations

• The multi-hour bandwidth packing problem
• The combinatorial bandwidth packing problem
• Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures
• Bandwidth Packing: A Tabu Search Approach
• Bandwidth packing with priority classes

Cited in

(24)

• Cross line and column generation for the cut covering problem in wireless networks
• scientific article; zbMATH DE number 6714114 (Why is no real title available?)
• The invisible‐hand heuristic for origin‐destination integer multicommodity network flows
• Integer programming for media streams planning problem
• Bandwidth Packing: A Tabu Search Approach
• Models for the piecewise linear unsplittable multicommodity flow problems
• On the minimum cost multiple-source unsplittable flow problem
• ATM VP-based network design
• Bandwidth packing problem with queueing delays: modelling and exact solution approach
• Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees
• Easy distributions for combinatorial optimization problems with probabilistic constraints
• Multicommodity information flow through quantum annealer
• A cutting plane approach to combinatorial bandwidth packing problem with queuing delays
• Optimal multicast route packing
• The combinatorial bandwidth packing problem
• Bandwidth packing with priority classes
• Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures
• The multi-hour bandwidth packing problem
• A branch and price approach for the robust bandwidth packing problem with queuing delays
• Integer programming for telecommunications
• Regenerator location problem in flexible optical networks
• Cover inequalities for robust knapsack sets -- application to the robust bandwidth packing problem
• A branch-and-price algorithm for the Steiner tree packing problem.
• The selection and scheduling of telecommunication calls with time windows

This page was built for publication: An Integer Programming Approach to the Bandwidth Packing Problem

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