The dynamic frequency assignment problem
From MaRDI portal
Publication:2378376
DOI10.1016/j.ejor.2008.01.028zbMath1156.90397OpenAlexW2003938855MaRDI QIDQ2378376
Dominique Feillet, Michel Vasquez, Andréa Carneiro Linhares, Christian Artigues, Audrey Dupont, Philippe Yves Paul Michelon
Publication date: 8 January 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.01.028
Related Items
An Exact Site Availability Approach to Modeling the D-FAP, \(L(3,2,1)\)-labeling of triangular and toroidal grids, An optimisation model for minimising changes in frequency allocations, Consistent neighborhood search for combinatorial optimization, Frequency assignment problem in networks with limited spectrum, A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints
- Robust discrete optimization and its applications
- On-line algorithms for the channel assignment problem in cellular networks.
- Efficient filtering and tabu search on a consistent neighbourhood for the frequency assignment problem with polarisation
- Distributive online channel assignment for hexagonal cellular networks with constraints
- Genetic and hybrid algorithms for graph coloring
- Algorithms for Radio Link Frequency Assignment: The Calma Project
- Dynamic Bin Packing
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
- Models and solution techniques for frequency assignment problems
- Models and solution techniques for frequency assignment problems