Pages that link to "Item:Q1377989"

The following pages link to The quadratic assignment problem. Theory and algorithms (Q1377989):

Displaying 50 items.

• Linearizable special cases of the QAP (Q266060) (← links)
• The bipartite quadratic assignment problem and extensions (Q322542) (← links)
• A game-theoretic algorithm for non-linear single-path routing problems (Q325393) (← links)
• Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances (Q336931) (← links)
• Exact algorithms for the solution of the grey pattern quadratic assignment problem (Q494699) (← links)
• On improving convex quadratic programming relaxation for the quadratic assignment problem (Q498438) (← links)
• Conformal Wasserstein distances: comparing surfaces in polynomial time (Q544003) (← 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)
• Global optimization of a class of nonconvex quadratically constrained quadratic programming problems (Q644622) (← links)
• The random quadratic assignment problem (Q658428) (← links)
• The Wiener maximum quadratic assignment problem (Q665991) (← links)
• Two classes of quadratic assignment problems that are solvable as linear assignment problems (Q665995) (← links)
• Continuation methods for approximate large scale object sequencing (Q669313) (← links)
• Selected topics on assignment problems (Q697571) (← links)
• Discrete location problems with push-pull objectives (Q697575) (← links)
• Copositive and semidefinite relaxations of the quadratic assignment problem (Q834180) (← 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)
• Assignment problems: a golden anniversary survey (Q852938) (← links)
• Detailed layout planning for irregularly-shaped machines with transportation path design (Q856265) (← 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)
• Resource assignment with preference conditions (Q869582) (← links)
• The quadratic knapsack problem -- a survey (Q875597) (← links)
• Generating QAP instances with known optimum solution and additively decomposable cost function (Q887857) (← links)
• Distribution functions, extremal limits and optimal transport (Q898076) (← links)
• Random assignment problems (Q953417) (← links)
• Mapping the convergence of genetic algorithms (Q955480) (← 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)
• Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number (Q1602705) (← links)
• Effect of transformations of numerical parameters in automatic algorithm configuration (Q1634780) (← links)
• A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems (Q1662098) (← links)
• The quadratic minimum spanning tree problem and its variations (Q1662110) (← links)
• Locating names on vertices of a transaction network (Q1683066) (← links)
• The bilinear assignment problem: complexity and polynomially solvable special cases (Q1683688) (← links)
• The multi-stripe travelling salesman problem (Q1698268) (← links)
• Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
• Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis (Q1728217) (← links)
• A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints (Q1742190) (← links)
• New special cases of the quadratic assignment problem with diagonally structured coefficient matrices (Q1754256) (← links)
• Another well-solvable case of the QAP: maximizing the job completion time variance (Q1758277) (← links)
• New linearizations of quadratic assignment problems (Q1761235) (← links)
• Classes of quadratic assignment problem instances: Isomorphism and difficulty measure using a statistical approach (Q1850122) (← links)
• The extended concentric tabu for the quadratic assignment problem (Q1887907) (← links)
• A new greedy algorithm for the quadratic assignment problem (Q1940429) (← links)
• Combinatorial optimization with interaction costs: complexity and solvable cases (Q2010918) (← links)
• Biologically inspired parent selection in genetic algorithms (Q2178305) (← links)
• Embedding signed graphs in the line (Q2253962) (← links)