Local search and the local structure of NP-complete problems
From MaRDI portal
Publication:1200797
DOI10.1016/0167-6377(92)90049-9zbMath0768.90088OpenAlexW2145255833MaRDI QIDQ1200797
Publication date: 16 January 1993
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(92)90049-9
Related Items
Quasiabelian landscapes of the traveling salesman problem are elementary, Graph Laplacians, nodal domains, and hyperplane arrangements, Rugged and Elementary Landscapes, Landscapes and their correlation functions, On the quality of local search for the quadratic assignment problem, The bilinear assignment problem: complexity and polynomially solvable special cases, Computing the moments \(k\)-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time, Autocorrelation measures for the quadratic assignment problem, On the classification of NP-complete problems in terms of their correlation coefficient, Elementary landscape decomposition of the frequency assignment problem, The theory of elementary landscapes, Weakly symmetric graphs, elementary landscapes, and the TSP, Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis, Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms, Minimum number of below average triangles in a weighted complete graph, Traveling salesman problem and local search, The component model for elementary landscapes and partial neighborhoods, Neutrality in fitness landscapes., Arbitrary elementary landscapes \& AR(1) processes, The characteristic landscape equation for an AR(2) landscape, Local search structure in the symmetric travelling salesperson problem under a general class of rearrangement neighborhoods, Dynamics of local search trajectory in traveling salesman problem, Generalized \(k\)-multiway cut problems, Some additional properties of elementary landscapes, Linearity in the traveling salesman problem, Landscapes on spaces of trees, Using group theory and transition matrices to study a class of metaheuristic neighborhoods, Domination analysis of some heuristics for the traveling salesman problem, Fast Fourier transform for fitness landscapes
Cites Work
