ATM VP-based network design

DOI10.1016/S0377-2217(03)00372-2zbMATH Open1056.90021OpenAlexW2008929768MaRDI QIDQ596263FDOQ596263

Sungsoo Park, Jangha Kang, Kyungchul Park

Publication date: 10 August 2004

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00372-2

zbMATH Keywords

RoutingTelecommunicationsBin packingColumn generationCutting planeInteger programming

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Algorithms for the variable sized bin packing problem
• Branch-and-price: Column generation for solving huge integer programs
• The cutting stock problem and integer rounding
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• On the Complexity of Timetable and Multicommodity Flow Problems
• Finding the K Shortest Loopless Paths in a Network
• Bandwidth Packing: A Tabu Search Approach
• An Integer Programming Approach to the Bandwidth Packing Problem
• Bin packing with divisible item sizes
• A polyhedral approach to edge coloring

Cited In (3)

• ATM network design for corporate networks
• On the enrouting protocol problem under uncertainty
• Optimal multicast route packing

Uses Software

• Tabu search

This page was built for publication: ATM VP-based network design

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