The following pages link to The Quadratic Assignment Problem (Q2778995):
Displaying 50 items.
- The bipartite quadratic assignment problem and extensions (Q322542) (← links)
- Lower bounding procedures for the single allocation hub location problem (Q325391) (← links)
- Lower bounds and exact algorithms for the quadratic minimum spanning tree problem (Q342052) (← links)
- Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation (Q342082) (← links)
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers (Q367651) (← links)
- A branch-and-bound algorithm for the single-row equidistant facility layout problem (Q421088) (← links)
- Two-stage quadratic integer programs with stochastic right-hand sides (Q431020) (← links)
- A generalized Gilmore-Lawler procedure for the quadratic assignment problem (Q510938) (← links)
- Quadratic assignment problems (Q594767) (← links)
- Two classes of quadratic assignment problems that are solvable as linear assignment problems (Q665995) (← links)
- Comparison of the performance of modern heuristics for combinatorial optimization on real data (Q690010) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing (Q703914) (← links)
- Efficient models for the facility layout problem (Q803026) (← links)
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem (Q847851) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Assignment problems: a golden anniversary survey (Q852938) (← links)
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations (Q856686) (← links)
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem (Q872113) (← links)
- Methods for the one-dimensional space allocation problem (Q916571) (← links)
- Mapping the convergence of genetic algorithms (Q955480) (← links)
- Repulsive assignment problem (Q963661) (← 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)
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (Q976396) (← links)
- A new relaxation framework for quadratic assignment problems based on matrix splitting (Q977330) (← links)
- Unit integer quadratic binary programming (Q1053599) (← links)
- An exact algorithm for the general quadratic assignment problem (Q1067975) (← links)
- On lower bounds for a class of quadratic 0,1 programs (Q1072937) (← links)
- The facility layout problem (Q1088577) (← links)
- A heuristic method for the multi-story layout problem (Q1107411) (← links)
- The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
- A parallel depth first search branch and bound algorithm for the quadratic assignment problem (Q1130079) (← links)
- Contributions to the quadratic assignment problem (Q1142700) (← links)
- A heuristic procedure for solving the quadratic assignment problem (Q1158105) (← links)
- On the quadratic assignment problem (Q1173009) (← links)
- Single and multiple period layout models for automated manufacturing systems (Q1175306) (← links)
- A location problem on unicyclic networks: Balanced case (Q1196028) (← links)
- Simulated annealing for machine layout problems in the presence of zoning constraints (Q1197690) (← links)
- Layout design for flexible manufacturing systems (Q1197691) (← links)
- A distance assignment approach to the facility layout problem (Q1197697) (← links)
- Computational performance and efficiency of lower-bound procedures for the dynamic facility layout problem (Q1197698) (← links)
- Generating quadratic assignment test problems with known optimal permutations (Q1203071) (← links)
- Algorithms for robust single and multiple period layout planning for manufacturing systems (Q1205706) (← links)
- An interactive layout heuristic based on hexagonal adjacency graphs (Q1205707) (← links)
- Integer programming formulation of combinatorial optimization problems (Q1239086) (← links)
- An algorithm for the quadratic assignment problem using Benders' decomposition (Q1247369) (← links)
- A solvable case of the quadratic assignment problem (Q1267182) (← links)
- Optimizing simulated annealing schedules with genetic programming (Q1268274) (← links)
