A column generation and branch-and-cut algorithm for the channel assignment problem
From MaRDI portal
Publication:941544
DOI10.1016/J.COR.2006.07.012zbMATH Open1166.90352OpenAlexW2019749891MaRDI QIDQ941544FDOQ941544
Authors: Têkogan D. Hemazro, Brigitte Jaumard, Odile Marcotte 
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
Recommendations
- Comparison of column generation models for channel assignment in cellular 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
- An enumerative algorithm for the frequency assignment problem
- Channel allocation in cellular radio networks
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Cites Work
- Algorithms for Radio Link Frequency Assignment: The Calma Project
- A Column Generation Approach for Graph Coloring
- An exact algorithm for the maximum clique problem
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- Title not available (Why is that?)
- Frequency assignment in mobile radio systems using branch-and-cut techniques
- Erratum to ``Comparison of column generation models for channel assignment in cellular networks
- APPLICATION OF THE GRAPH COLORING ALGORITHM TO THE FREQUENCY ASSIGNMENT PROBLEM
- Frequency assignment in cellular phone networks
- A tabu search algorithm for frequency assignment
Cited In (7)
- A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
- A simple branching scheme for vertex coloring problems
- Frequency assignment in mobile radio systems using branch-and-cut techniques
- An improved configuration checking-based algorithm for the unicost set covering problem
- BDD-based optimization for the quadratic stable set problem
- Comparison of column generation models for channel assignment in cellular networks
- Cross line and column generation for the cut covering problem in wireless networks
Uses Software
This page was built for publication: A column generation and branch-and-cut algorithm for the channel assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q941544)
