The following pages link to QAPLIB (Q13502):
Displaying 50 items.
- A feasible method for optimization with orthogonality constraints (Q101635) (← links)
- A hybrid biased random key genetic algorithm for the quadratic assignment problem (Q280940) (← links)
- A parallel ordering problem in facilities layout (Q336660) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers (Q367651) (← links)
- Global optimality conditions and optimization methods for quadratic assignment problems (Q422852) (← links)
- Autocorrelation measures for the quadratic assignment problem (Q429187) (← links)
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry (Q431008) (← links)
- Interior point methods 25 years later (Q439546) (← links)
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem (Q443828) (← links)
- A splitting method for orthogonality constrained problems (Q461228) (← links)
- On improving convex quadratic programming relaxation for the quadratic assignment problem (Q498438) (← links)
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints (Q499161) (← links)
- Experimental analysis of crossover and mutation operators on the quadratic assignment problem (Q513133) (← links)
- A robust Lagrangian-DNN method for a class of quadratic optimization problems (Q523570) (← links)
- Dual ascent: variations of a theme (Q537601) (← links)
- Investigating the performance of bees algorithm in solving quadratic assignment problems (Q606608) (← links)
- Semidefinite approximations for quadratic programs over orthogonal matrices (Q609564) (← links)
- Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem (Q614047) (← links)
- Two classes of quadratic assignment problems that are solvable as linear assignment problems (Q665995) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem (Q732777) (← links)
- To lay out or not to lay out? (Q763111) (← links)
- GRASP with path-relinking for the generalized quadratic assignment problem (Q763245) (← links)
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
- Towards a new evolutionary computation. Advances on estimation of distribution algorithms. (Q819199) (← links)
- Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization (Q823888) (← links)
- Copositive and semidefinite relaxations of the quadratic assignment problem (Q834180) (← links)
- Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem (Q842713) (← links)
- A genetic ant colony optimisation system (GenANT) for quadratic assignment problems (Q843378) (← links)
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem (Q847851) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations (Q856686) (← links)
- Optimization of the quadratic assignment problem using an ant colony algorithm (Q864790) (← links)
- A note on a polynomial time solvable case of the quadratic assignment problem (Q865755) (← links)
- Bounds for the quadratic assignment problem using the bundle method (Q868474) (← links)
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem (Q872113) (← links)
- Generating QAP instances with known optimum solution and additively decomposable cost function (Q887857) (← links)
- Analog computation through high-dimensional physical chaotic neuro-dynamics (Q933433) (← links)
- Metaheuristic downhill simplex method in combinatorial optimization (Q941194) (← links)
- Convergence of a modified algorithm of fast probabilistic modeling (Q946727) (← links)
- Random assignment problems (Q953417) (← links)
- Backbone analysis and algorithm design for the quadratic assignment problem (Q954381) (← links)
- Effective formulation reductions for the quadratic assignment problem (Q976022) (← links)
- The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm (Q976040) (← links)
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs (Q977327) (← links)
- A new relaxation framework for quadratic assignment problems based on matrix splitting (Q977330) (← links)
- Exploiting special structure in semidefinite programming: a survey of theory and applications (Q1044129) (← links)
- A parallel depth first search branch and bound algorithm for the quadratic assignment problem (Q1130079) (← links)
- Lower bounds for nonlinear assignment problems using many body interactions (Q1291723) (← links)
