Elementary landscape decomposition of the frequency assignment problem

DOI10.1016/j.tcs.2011.02.011zbMath1229.90154OpenAlexW2127340791MaRDI QIDQ652134

Enrique Alba, Francisco Luna, L. Darrell Whitley, Francisco Chicano

Publication date: 19 December 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.02.011

zbMATH Keywords

frequency assignmentelementary landscapesfitness landscapes

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)

Related Items

The component model for elementary landscapes and partial neighborhoods ⋮ Incidence coloring of mycielskians with fast algorithm

Uses Software

• CALMA

Cites Work

• Correlated and uncorrelated fitness landscapes and how to tell the difference
• Autocorrelation coefficient for the graph bipartitioning problem
• Traveling salesman problem and local search
• Local search and the local structure of NP-complete problems
• Landscapes and their correlation functions
• Combinatorial Landscapes
• Models and solution techniques for frequency assignment problems
• On the landscape ruggedness of the quadratic assignment problem