Comparison of column generation models for channel assignment in cellular networks

DOI10.1016/S0166-218X(00)00317-6zbMath0988.90544OpenAlexW2078886048MaRDI QIDQ5946824

Brigitte Jaumard, Tsevi Vovor, Odile Marcotte, Christophe Meyer

Publication date: 4 July 2002

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00317-6

Mathematics Subject Classification ID

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

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• A generalized linear programming model for nurse scheduling
• 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

This page was built for publication: Comparison of column generation models for channel assignment in cellular networks