Pages that link to "Item:Q852928"

The following pages link to A survey for the quadratic assignment problem (Q852928):

Displaying 50 items.

• A deterministic annealing algorithm for approximating a solution of the min-bisection problem (Q280315) (← links)
• A hybrid biased random key genetic algorithm for the quadratic assignment problem (Q280940) (← links)
• A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes (Q300033) (← links)
• On the geometry of graph spaces (Q317419) (← links)
• Single row layout models (Q319651) (← links)
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances (Q336931) (← links)
• An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes (Q336992) (← links)
• A nonmonotone GRASP (Q340011) (← 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)
• Global optimality conditions and optimization methods for quadratic assignment problems (Q422852) (← 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)
• 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)
• Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town? (Q621921) (← links)
• An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems (Q621965) (← links)
• Global optimization of a class of nonconvex quadratically constrained quadratic programming problems (Q644622) (← links)
• The random quadratic assignment problem (Q658428) (← links)
• Continuation methods for approximate large scale object sequencing (Q669313) (← 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)
• Evolutionary decision-makings for the dynamic weapon-target assignment problem (Q848404) (← links)
• Generating QAP instances with known optimum solution and additively decomposable cost function (Q887857) (← links)
• A semidefinite optimization approach to the target visitation problem (Q895779) (← links)
• Random assignment problems (Q953417) (← links)
• Effective formulation reductions for the quadratic assignment problem (Q976022) (← 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)
• An algorithm for the generalized quadratic assignment problem (Q1001198) (← links)
• Robust optimization of internal transports at a parcel sorting center operated by Deutsche Post world net (Q1037666) (← links)
• Survey of quantitative methods in construction (Q1651605) (← links)
• Improved exact approaches for row layout problems with departments of equal length (Q1651703) (← links)
• A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems (Q1662098) (← links)
• Fast simulated annealing for single-row equidistant facility layout (Q1663580) (← links)
• Locating names on vertices of a transaction network (Q1683066) (← links)
• Optimal rates of statistical seriation (Q1715546) (← links)
• Generating constrained length personalized bicycle tours (Q1728418) (← links)
• An exact algorithm for the minimum squared load assignment problem (Q1734825) (← links)
• Semidefinite programming approach for the quadratic assignment problem with a sparse graph (Q1744907) (← links)
• Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions (Q1753550) (← links)
• New special cases of the quadratic assignment problem with diagonally structured coefficient matrices (Q1754256) (← links)
• New linearizations of quadratic assignment problems (Q1761235) (← links)
• Discrete and geometric branch and bound algorithms for~medical image registration (Q1761852) (← links)
• The dynamic space allocation problem: applying hybrid GRASP and tabu search metaheuristics (Q1762023) (← links)
• Evaluation of the multiobjective ant colony algorithm performances on biobjective quadratic assignment problems (Q1789471) (← links)
• A fast algorithm to generate feasible solution of production facilities layout based on plane segmentation (Q1792742) (← links)