Elementary landscape decomposition of the frequency assignment problem
From MaRDI portal
Publication:652134
DOI10.1016/J.TCS.2011.02.011zbMATH Open1229.90154OpenAlexW2127340791MaRDI QIDQ652134FDOQ652134
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
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)
Uses Software
Recommendations
- Using Laplacian eigenvalues and eigenvectors in the analysis of frequency assignment problems π π
- Solving frequency assignment problems via tree-decomposition π π
- Title not available (Why is that?) π π
- Frequency planning and ramifications of coloring π π
- Title not available (Why is that?) π π
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)