Random walk's correlation function for multi-objective NK landscapes and quadratic assignment problem

DOI10.1007/S10878-019-00445-7MaRDI QIDQ2279759zbMATH OpenOpenAlexFDO

Authors Madalina M. Drugan

Publication date 13 December 2019

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-019-00445-7

zbMATH Keywords

graph Laplacianmatrix theorymulti-objective optimizationneighbourhood functionrandom walk

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial optimization (90C27) Multi-objective and goal programming (90C29)

Recommendations

• On the use of random walks to estimate correlation in fitness landscapes.
• A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
• Autocorrelation measures for the quadratic assignment problem
• Correlated and uncorrelated fitness landscapes and how to tell the difference
• On the classification of NP-complete problems in terms of their correlation coefficient

Cites work

• Assignment Problems and the Location of Economic Activities
• Autocorrelation measures for the quadratic assignment problem
• Combinatorial landscapes
• Computing the moments k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time
• Future paths for integer programming and links to artificial intelligence
• scientific article; zbMATH DE number 1962868 (Why is no real title available?)
• scientific article; zbMATH DE number 1975087 (Why is no real title available?)
• scientific article; zbMATH DE number 867649 (Why is no real title available?)
• scientific article; zbMATH DE number 6125590 (Why is no real title available?)
• scientific article; zbMATH DE number 3097527 (Why is no real title available?)
• Landscapes and their correlation functions
• Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
• Measuring instance difficulty for combinatorial optimization problems
• Multicriteria Optimization
• On the second largest Laplacian eigenvalues of graphs
• The component model for elementary landscapes and partial neighborhoods
• The Laplacian spectrum of a graph
• The quadratic assignment problem. Theory and algorithms
• The theory of elementary landscapes
• Working principles, behavior, and performance of MOEAs on MNK-landscapes

Cited in

(1)

• On the use of random walks to estimate correlation in fitness landscapes.

This page was built for publication: Random walk's correlation function for multi-objective NK landscapes and quadratic assignment problem

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