Models and solution techniques for frequency assignment problems
From MaRDI portal
Publication:5907051
zbMath1042.90049MaRDI QIDQ5907051
Antonio Sassano, Arie M. C. A. Koster, Stan P. M. van Hoesel, Carlo Mannino, Karen Aardal
Publication date: 19 February 2004
Published in: 4OR (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
An Exact Site Availability Approach to Modeling the D-FAP, Three tabu search methods for the MI-FAP applied to 802.11 networks, Twelve surveys in operations research, The dynamic frequency assignment problem, Greedy online frequency allocation in cellular networks, The stable set problem and the thinness of a graph, A memetic algorithm for channel assignment in wireless FDMA systems, Optimizing base station location and configuration in UMTS networks, Better bounds for incremental frequency allocation in bipartite graphs, Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids, Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth, Genetic tabu search for robust fixed channel assignment under dynamic traffic data, Elementary landscape decomposition of the frequency assignment problem, Cellular network configuration with co-channel and adjacent-channel interference constraints, Multi-coloring and job-scheduling with assignment and incompatibility costs, Surveys in operations research, A graph coloring heuristic using partial solutions and a reactive tabu scheme, Eleven surveys in operations research, Graph labellings with variable weights, a survey, Solving a multicoloring problem with overlaps using integer programming, Tight LP‐based lower bounds for wavelength conversion in optical networks, Models and solution techniques for frequency assignment problems, Constraint Propagation with Tabu List for Min-Span Frequency Assignment Problem, A simple branching scheme for vertex coloring problems, Heuristic manipulation, tabu search and frequency assignment, A 1-local asymptotic 13/9-competitive algorithm for multicoloring hexagonal graphs, Three results on frequency assignment in linear cellular networks, Solving a minimum-power covering problem with overlap constraint for cellular network design
Uses Software
