The following pages link to (Q4321546):
Displayed 42 items.
- Global optimality conditions and optimization methods for quadratic assignment problems (Q422852) (← links)
- The equilibrium generalized assignment problem and genetic algorithm (Q422905) (← links)
- Interior point methods 25 years later (Q439546) (← links)
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
- The multi-story space assignment problem (Q610966) (← links)
- Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem (Q614047) (← links)
- An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems (Q621965) (← links)
- The random quadratic assignment problem (Q658428) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- GRASP with path-relinking for the generalized quadratic assignment problem (Q763245) (← links)
- Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem (Q842713) (← links)
- A quadra-directional decomposition heuristic for a two-dimensional, non-equidistant machine-cell location problem (Q850313) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices (Q853797) (← links)
- Resource assignment with preference conditions (Q869582) (← links)
- Effective formulation reductions for the quadratic assignment problem (Q976022) (← links)
- New lower bounds for the triplanar assignment problem. Use of the classical model (Q1003082) (← links)
- Convex integer maximization via Graver bases (Q1017675) (← links)
- A solvable case of the quadratic assignment problem (Q1267182) (← links)
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases (Q1290637) (← links)
- An optimal tree search method for the manufacturing systems cell formation problem (Q1291773) (← links)
- Location and layout planning. A survey (Q1372765) (← links)
- Solution methods for the balancing of jet turbines (Q1373895) (← links)
- On the quality of local search for the quadratic assignment problem (Q1383366) (← links)
- A greedy genetic algorithm for the quadratic assignment problem (Q1577374) (← links)
- A novel chaotic search for quadratic assignment problems (Q1598725) (← links)
- Fast Fourier transform for fitness landscapes (Q1604498) (← links)
- A provable better Branch and Bound method for a nonconvex integer quadratic programming problem (Q1765223) (← links)
- Room allocation: a polynomial subcase of the quadratic assignment problem (Q1765233) (← links)
- Some global optimization problems on Stiefel manifolds (Q1768631) (← links)
- A performance guarantee heuristic for electronic components placement problems including thermal effects (Q1781568) (← links)
- Classes of quadratic assignment problem instances: Isomorphism and difficulty measure using a statistical approach (Q1850122) (← links)
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964) (← links)
- Lower bounds for the quadratic assignment problem via triangle decompositions (Q1914071) (← links)
- The three-dimensional assignment and partition problems. New lower bounds (Q2457504) (← links)
- Efficiently solvable cases of quadratic assignment problem with generalized monotonic and incomplete anti-Monge matrices (Q2458114) (← links)
- Iterated local search for the quadratic assignment problem (Q2503224) (← links)
- COSEARCH: A parallel cooperative metaheuristic (Q2506211) (← links)
- An efficient continuation method for quadratic assignment problems (Q2654391) (← links)
- NON-RIGID SPECTRAL CORRESPONDENCE OF TRIANGLE MESHES (Q3503029) (← links)
- Advances in metric embedding theory (Q5894374) (← links)