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

DOI10.1016/S0166-218X(02)00176-2zbMath0994.90099OpenAlexW2203142848MaRDI QIDQ1602699

Christophe Meyer, Tsevi Vovor, Brigitte Jaumard, Odile Marcotte

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

branch-and-bound0-1 programminginteger linear programming

Mathematics Subject Classification ID

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

Related Items

A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem, A column generation and branch-and-cut algorithm for the channel assignment problem, Models and solution techniques for frequency assignment problems

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• A generalized linear programming model for nurse scheduling
• Stabilized column generation
• The partial constraint satisfaction problem: Facets and lifting theorems
• Bounds for the frequency assignment problem
• A potential reduction approach to the frequency assignment problem
• Frequency assignment in cellular phone networks
• Frequency assignment in mobile radio systems using branch-and-cut techniques
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
• Vertex packings: Structural properties and algorithms
• A Column Generation Approach for Graph Coloring
• Properties of vertex packing and independence system polyhedra
• On the facial structure of set packing polyhedra