The following pages link to The Quadratic Assignment Problem (Q2778995):
Displayed 50 items.
- Quadratic assignment problems (Q594767) (← 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)
- 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)
- 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)
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases (Q1290637) (← links)
- Network-based formulations of the quadratic assignment problem (Q1291651) (← links)
- Lower bounds for nonlinear assignment problems using many body interactions (Q1291723) (← links)
- A GRASP for the biquadratic assignment problem (Q1291786) (← links)
- Move based heuristics for the unidirectional loop network layout problem (Q1295994) (← links)
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method (Q1296800) (← links)
- A variant of time minimizing assignment problem (Q1303581) (← links)
- A heuristic for cyclic stochastic sequencing of tasks on a drum-like storage system (Q1318457) (← links)
- Strengthening Gilmore's bound for the quadratic assignment problem (Q1333480) (← links)
- Lower bounds for the quadratic assignment problem (Q1339141) (← links)
- A new exact algorithm for the solution of quadratic assignment problems (Q1343146) (← links)
- Solution methods for the balancing of jet turbines (Q1373895) (← links)
- A classification of formulations for the (time-dependent) traveling salesman problem (Q1388929) (← links)
- A heuristic procedure for the single-row facility layout problem (Q1390259) (← links)
- FACOPT: A user friendly FACility layout OPTimization system. (Q1422356) (← links)