Pages that link to "Item:Q1200797"
From MaRDI portal
The following pages link to Local search and the local structure of NP-complete problems (Q1200797):
Displaying 39 items.
- Computing the moments \(k\)-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time (Q418028) (← links)
- Autocorrelation measures for the quadratic assignment problem (Q429187) (← links)
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms (Q482289) (← links)
- Elementary landscape decomposition of the frequency assignment problem (Q652134) (← links)
- LocalSolver 1.x: A black-box local-search solver for 0-1 programming (Q657572) (← links)
- Local search, reducibility and approximability of NP-optimization problems (Q673464) (← links)
- Quasiabelian landscapes of the traveling salesman problem are elementary (Q834186) (← links)
- Some additional properties of elementary landscapes (Q1027500) (← links)
- Traveling salesman problem and local search (Q1195657) (← links)
- Landscapes and their correlation functions (Q1381249) (← links)
- On the quality of local search for the quadratic assignment problem (Q1383366) (← links)
- The theory of elementary landscapes (Q1431939) (← links)
- Weakly symmetric graphs, elementary landscapes, and the TSP (Q1431950) (← links)
- Linearity in the traveling salesman problem (Q1588746) (← links)
- Using group theory and transition matrices to study a class of metaheuristic neighborhoods (Q1600935) (← links)
- Domination analysis of some heuristics for the traveling salesman problem (Q1602706) (← links)
- Fast Fourier transform for fitness landscapes (Q1604498) (← links)
- The bilinear assignment problem: complexity and polynomially solvable special cases (Q1683688) (← links)
- Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis (Q1728217) (← links)
- Local search algorithms for the \(k\)-cardinality tree problem. (Q1811129) (← links)
- The query complexity of finding local minima in the lattice (Q1854471) (← links)
- Landscapes on spaces of trees (Q1855800) (← links)
- Graph Laplacians, nodal domains, and hyperplane arrangements (Q1886532) (← links)
- On the classification of NP-complete problems in terms of their correlation coefficient (Q1962048) (← links)
- The component model for elementary landscapes and partial neighborhoods (Q2250997) (← links)
- Minimum number of below average triangles in a weighted complete graph (Q2465935) (← links)
- Arbitrary elementary landscapes \& AR(1) processes (Q2484611) (← links)
- The characteristic landscape equation for an AR(2) landscape (Q2488704) (← links)
- Dynamics of local search trajectory in traveling salesman problem (Q2491325) (← links)
- Generalized \(k\)-multiway cut problems (Q2504075) (← links)
- Simple Local Search Problems that are Hard to Solve (Q3204045) (← links)
- Rugged and Elementary Landscapes (Q3459673) (← links)
- Local Symmetry Breaking During Search in CSPs (Q3523057) (← links)
- (Q4495202) (← links)
- The communication complexity of local search (Q5212806) (← links)
- A Local Criterion for Polynomial-Time Stratified Computations (Q5747634) (← links)
- (Q5875699) (← links)
- Neutrality in fitness landscapes. (Q5931693) (← links)
- Local search structure in the symmetric travelling salesperson problem under a general class of rearrangement neighborhoods (Q5938887) (← links)