Elementary landscape decomposition of the frequency assignment problem

DOI10.1016/J.TCS.2011.02.011MaRDI QIDQ652134zbMATHOpenAlexFDO

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

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)

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

Cites work

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

Cited in

(4)

• Incidence coloring of mycielskians with fast algorithm
• The component model for elementary landscapes and partial neighborhoods
• Using Laplacian eigenvalues and eigenvectors in the analysis of frequency assignment problems
• scientific article; zbMATH DE number 1727373 (Why is no real title available?)

Describes a project that uses

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)