Application of graph-theoretic approaches to the random landscapes of the three-dimensional assignment problem

DOI10.1007/s11590-011-0396-xzbMath1261.90045OpenAlexW1970679816MaRDI QIDQ1936794

Alla R. Kammerdiner, Eduardo L. Pasiliao

Publication date: 7 February 2013

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-011-0396-x

zbMATH Keywords

eigenvaluesdigraphsLaplacian matrixsearch algorithmsfitness landscapealgebraic multiplicityspanning forests

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (1)

Landscape properties of the very large-scale and the variable neighborhood search metaheuristics for the multidimensional assignment problem

Cites Work

• On the Hamming distance in combinatorial optimization problems on hypergraph matchings
• On the number of local minima for the multidimensional assignment problem
• Random assignment problems
• Landscapes and their correlation functions
• Fast Fourier transform for fitness landscapes
• On the spectra of nonsymmetric Laplacian matrices
• Spanning forests of a digraph and their applications

This page was built for publication: Application of graph-theoretic approaches to the random landscapes of the three-dimensional assignment problem