Elementary landscape decomposition of the frequency assignment problem

DOI10.1016/J.TCS.2011.02.011zbMATH Open1229.90154OpenAlexW2127340791MaRDI QIDQ652134FDOQ652134

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

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

Recommendations

• Using Laplacian eigenvalues and eigenvectors in the analysis of frequency assignment problems
• Solving frequency assignment problems via tree-decomposition
• scientific article; zbMATH DE number 1727373
• Frequency planning and ramifications of coloring
• scientific article; zbMATH DE number 1819633

zbMATH Keywords

frequency assignmentelementary landscapesfitness landscapes

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• The component model for elementary landscapes and partial neighborhoods
• Incidence coloring of mycielskians with fast algorithm
• Using Laplacian eigenvalues and eigenvectors in the analysis of frequency assignment problems
• Title not available (Why is that?)

Uses Software

• CALMA

This page was built for publication: Elementary landscape decomposition of the frequency assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q652134)