Three tabu search methods for the MI-FAP applied to 802.11 networks
From MaRDI portal
Publication:3163671
DOI10.1051/ro:2008026zbMath1205.68390OpenAlexW2030884201MaRDI QIDQ3163671
Nicolas Zufferey, Sacha C. Varone
Publication date: 26 October 2010
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/105417
Searching and sorting (68P10) Numerical optimization and variational techniques (65K10) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Uses Software
Cites Work
- Using tabu search techniques for graph coloring
- Hybrid evolutionary algorithms for graph coloring
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- Tabu search for frequency assignment in mobile radio networks
- Tabu Search—Part I
- Tabu Search—Part II
- The Reactive Tabu Search
- Frequency planning and ramifications of coloring
- Models and solution techniques for frequency assignment problems