ATM VP-based network design
From MaRDI portal
Publication:596263
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A polyhedral approach to edge coloring
- Algorithms for the variable sized bin packing problem
- An Integer Programming Approach to the Bandwidth Packing Problem
- Bandwidth Packing: A Tabu Search Approach
- Bin packing with divisible item sizes
- Branch-and-price: Column generation for solving huge integer programs
- Finding the K Shortest Loopless Paths in a Network
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- On the Complexity of Timetable and Multicommodity Flow Problems
- The cutting stock problem and integer rounding
Cited in
(5)
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)