Comparison of column generation models for channel assignment in cellular networks
From MaRDI portal
This article has been reprinted due to the omission of proof corrections in ibid. 118, 299-322 (2002; Zbl 0994.90099).
Recommendations
- A column generation and branch-and-cut algorithm for the channel assignment problem
- Erratum to ``Comparison of column generation models for channel assignment in cellular networks
- Optimal traffic assignment in a SS/TDMA frame : a new approach by set covering and column generation
- Channel allocation in cellular radio networks
- Models and solution techniques for frequency assignment problems
Cites work
- A Column Generation Approach for Graph Coloring
- A generalized linear programming model for nurse scheduling
- A potential reduction approach to the frequency assignment problem
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- Bounds for the frequency assignment problem
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Frequency assignment in cellular phone networks
- Frequency assignment in mobile radio systems using branch-and-cut techniques
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- On the facial structure of set packing polyhedra
- Properties of vertex packing and independence system polyhedra
- The partial constraint satisfaction problem: Facets and lifting theorems
- Vertex packings: Structural properties and algorithms
Cited in
(3)
This page was built for publication: Comparison of column generation models for channel assignment in cellular networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5946824)