Pages that link to "Item:Q1377989"

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

Displaying 50 items.

• 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)
• A convex form of the quadratic assignment problem (Q1804071) (← 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)
• Dynamic programming for the quadratic assignment problem on trees (Q2261718) (← links)
• Random walk's correlation function for multi-objective NK landscapes and quadratic assignment problem (Q2279759) (← links)
• On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem (Q2285657) (← links)
• Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems (Q2329727) (← links)
• Linear programming insights into solvable cases of the quadratic assignment problem (Q2339831) (← links)
• Four-point conditions for the TSP: the complete complexity classification (Q2339841) (← links)
• Well-solvable cases of the QAP with block-structured matrices (Q2345597) (← links)
• A cooperative parallel tabu search algorithm for the quadratic assignment problem (Q2378423) (← links)
• Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example (Q2379867) (← links)
• Optimal role and position assignment in multi-robot freely reachable formations (Q2409250) (← links)
• A parallel water flow algorithm with local search for solving the quadratic assignment problem (Q2423282) (← links)
• A novel approach to fault tolerant multichannel networks designing problems (Q2442936) (← links)
• Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem (Q2456632) (← links)
• Efficiently solvable cases of quadratic assignment problem with generalized monotonic and incomplete anti-Monge matrices (Q2458114) (← links)
• Constrained 0-1 quadratic programming: basic approaches and extensions (Q2467302) (← links)
• Compounded genetic algorithms for the quadratic assignment problem (Q2488198) (← links)
• A divide-and-conquer local search heuristic for data visualization (Q2499138) (← links)
• COSEARCH: A parallel cooperative metaheuristic (Q2506211) (← links)
• Hybrid population-based algorithms for the bi-objective quadratic assignment problem (Q2506218) (← links)
• A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices (Q2572862) (← links)
• An efficient continuation method for quadratic assignment problems (Q2654391) (← links)
• A hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problem (Q2666872) (← links)
• Selection hyper-heuristics for the multi and many-objective quadratic assignment problem (Q2676362) (← links)
• SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546) (← links)
• Global Approaches for Facility Layout and VLSI Floorplanning (Q2802548) (← links)
• Approximating the minimum quadratic assignment problems (Q2930294) (← links)
• Exact and heuristic algorithms for the weighted feedback arc set problem: A special case of the skew-symmetric quadratic assignment problem (Q3033586) (← links)
• Three Ideas for the Quadratic Assignment Problem (Q3144407) (← links)
• Weighted Optimization with Thresholding for Complete-Case Analysis (Q3296452) (← links)
• A new linearization method for quadratic assignment problems (Q3423596) (← links)
• Asymptotic Properties of the Quadratic Assignment Problem (Q3696855) (← links)
• (Q3840375) (← links)
• Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem (Q4427381) (← links)
• Quadratic assignment problem QAP with adaptable material handling devices (Q4497217) (← links)
• Extending time‐to‐target plots to multiple instances (Q4624885) (← links)
• Conformal Wasserstein distance: II. computational aspects and extensions (Q4911906) (← links)
• Graph Similarity and Approximate Isomorphism (Q5005120) (← links)
• BRANCHING TECHNIQUE FOR A BI-OBJECTIVE TWO-STAGE ASSIGNMENT PROBLEM (Q5038210) (← links)
• Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
• The Rank-One Quadratic Assignment Problem (Q5085471) (← links)