Erratum to ``Comparison of column generation models for channel assignment in cellular networks

DOI10.1016/S0166-218X(02)00176-2MaRDI QIDQ1602699zbMATH OpenOpenAlexFDO

Authors Brigitte Jaumard, Odile Marcotte, Christophe Meyer, Tsevi Vovor

Publication date 24 June 2002

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(02)00176-2

zbMATH Keywords

0-1 programmingbranch-and-boundinteger linear programming

Mathematics Subject Classification ID

Boolean programming (90C09) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Review text

The authors present three different mathematical programming formulation of the channel assignment problem as a linear integer 0-1 problem. They consider the objective of minimizing the unsatisfied channel demand while satisfying the co-channel, the adjacent channel and the antenna channel spacing constrains. In the first formulation the decision variable are of the form \(x(i,f)\), where \(x(i,f)\) takes the value 1 if and only if the channel \(f\) is assigned to an antenna of cell \(C_i\). The second and third formulations are the set covering formulations amenable to solution by column generation technique. After that they compare the three formulations and present computational results that support the theoretical comparison of the models. For the original article, see ibid. 112, 217-240 (2001; Zbl 0988.90544).

Recommendations

• Comparison of column generation models for channel assignment in cellular networks
• Corrigendum: Static frequency assignment in cellular networks
• Correction to: ``Power efficient uplink scheduling in SC-FDMA: benchmarking by column generation
• Errata to “Wireless Multicast Optimization: A Cross-Layer Approach” [ Jul 11 4333-4343]
• scientific article; zbMATH DE number 17557
• A stochastic model for cellassignments in PCS networks
• scientific article; zbMATH DE number 2009866
• The optimality of fixed channel assignment policies for cellular radio systems

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
• Stabilized column generation
• The partial constraint satisfaction problem: Facets and lifting theorems
• Vertex packings: Structural properties and algorithms

Cited in

(4)

• A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
• Models and solution techniques for frequency assignment problems
• Comparison of column generation models for channel assignment in cellular networks
• A column generation and branch-and-cut algorithm for the channel assignment problem

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: Erratum to ``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 Q1602699)