Pages that link to "Item:Q1383366"
From MaRDI portal
The following pages link to On the quality of local search for the quadratic assignment problem (Q1383366):
Displaying 21 items.
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms (Q482289) (← links)
- A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem (Q707153) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Random assignment problems (Q953417) (← links)
- Checking local optimality in constrained quadratic programming is NP- hard (Q1102861) (← links)
- Complexity of uniqueness and local search in quadratic 0-1 programming (Q1197889) (← 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)
- Classes of quadratic assignment problem instances: Isomorphism and difficulty measure using a statistical approach (Q1850122) (← links)
- On local search for the generalized graph coloring problem (Q1870000) (← links)
- Application of graph-theoretic approaches to the random landscapes of the three-dimensional assignment problem (Q1936794) (← links)
- On the classification of NP-complete problems in terms of their correlation coefficient (Q1962048) (← links)
- Efficient local search procedures for quadratic fractional programming problems (Q1986108) (← links)
- Breakout local search for the quadratic assignment problem (Q2350189) (← links)
- On the complexity of local search in unconstrained quadratic binary optimization (Q2810549) (← links)
- Methods of local search for a problem on the permutation of the columns of a binary matrix (Q2895861) (← links)
- Analysis of 2-Opt Heuristic for the Winner Determination Problem Under the Chamberlin-Courant System (Q2971639) (← links)
- Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms (Q3386794) (← links)
- Neutrality in fitness landscapes. (Q5931693) (← links)
- On the landscape ruggedness of the quadratic assignment problem (Q5941510) (← links)
- Adaptive memory programming: a unified view of metaheuristics (Q5954822) (← links)
