Pages that link to "Item:Q852928"
From MaRDI portal
The following pages link to A survey for the quadratic assignment problem (Q852928):
Displaying 32 items.
- An improved heuristic approach for multi-objective facility layout problem (Q3163738) (← links)
- CONVEX HULL PRESENTATION OF A QUADRATICALLY CONSTRAINED SET AND ITS APPLICATION IN SOLVING QUADRATIC PROGRAMMING PROBLEMS (Q3406726) (← links)
- A New Neighborhood for the QAP (Q3503523) (← links)
- Asymptotic Properties of the Quadratic Assignment Problem (Q3696855) (← links)
- Exact Recovery with Symmetries for the Doubly Stochastic Relaxation (Q4554591) (← links)
- Relaxations for Minimizing Metric Distortion and Elastic Energies for 3D Shape Matching (Q4682461) (← links)
- An experimental study of variable depth search algorithms for the quadratic assignment problem (Q4904331) (← links)
- A TISSUE P SYSTEM BASED SOLUTION TO QUADRATIC ASSIGNMENT PROBLEM (Q4923294) (← links)
- Scalable Semidefinite Programming (Q4999352) (← links)
- BRANCHING TECHNIQUE FOR A BI-OBJECTIVE TWO-STAGE ASSIGNMENT PROBLEM (Q5038210) (← links)
- Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
- Image Keypoint Matching Using Graph Neural Networks (Q5050354) (← links)
- A Branch-and-Bound Algorithm for Team Formation on Social Networks (Q5085484) (← links)
- The ‘Idiot’ crash quadratic penalty algorithm for linear programming and its application to linearizations of quadratic assignment problems (Q5113712) (← links)
- A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique (Q5131697) (← links)
- Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study (Q5131726) (← links)
- Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters (Q5139631) (← links)
- Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs (Q5148407) (← links)
- Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs (Q5232142) (← links)
- A hybrid ant colony optimization algorithm for solving facility layout problems formulated as quadratic assignment problems (Q5405956) (← links)
- Exact Solution of Two Location Problems via Branch-and-Bound (Q5506728) (← links)
- Facility layout problem with QAP formulation under scenario-based uncertainty (Q5882273) (← links)
- An efficient algorithm for unequal area facilities layout planning with input and output points (Q5884349) (← links)
- A note on the exact solution of the minimum squared load assignment problem (Q6047841) (← links)
- Gilmore-Lawler bound of quadratic assignment problem (Q6059115) (← links)
- Research trends in combinatorial optimization (Q6091419) (← links)
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique (Q6122081) (← links)
- Sinkhorn Algorithm for Lifted Assignment Problems (Q6133998) (← links)
- An LP-based characterization of solvable QAP instances with chess-board and graded structures (Q6168180) (← links)
- Sharing in construction projects -- on determining optimal container assignments for the on-site accommodation of trades (Q6554626) (← links)
- Comparing QUBO models for quantum annealing: integer encodings for permutation problems (Q6609696) (← links)
- Where the really hard quadratic assignment problems are: the QAP-SAT instances (Q6635983) (← links)