A column generation and branch-and-cut algorithm for the channel assignment problem

DOI10.1016/j.cor.2006.07.012zbMath1166.90352OpenAlexW2019749891MaRDI QIDQ941544

Odile Marcotte, Brigitte Jaumard, Têkogan D. Hemazro

Publication date: 1 September 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2006.07.012

zbMATH Keywords

cellular telephony

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)

Related Items (4)

BDD-based optimization for the quadratic stable set problem ⋮ A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem ⋮ An improved configuration checking-based algorithm for the unicost set covering problem ⋮ A simple branching scheme for vertex coloring problems

Uses Software

• ABACUS
• CALMA

Cites Work

• An exact algorithm for the maximum clique problem
• Frequency assignment in cellular phone networks
• Frequency assignment in mobile radio systems using branch-and-cut techniques
• Erratum to ``Comparison of column generation models for channel assignment in cellular networks
• A tabu search algorithm for frequency assignment
• Algorithms for Radio Link Frequency Assignment: The Calma Project
• A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
• A Column Generation Approach for Graph Coloring
• APPLICATION OF THE GRAPH COLORING ALGORITHM TO THE FREQUENCY ASSIGNMENT PROBLEM
• Unnamed Item

This page was built for publication: A column generation and branch-and-cut algorithm for the channel assignment problem