Pages that link to "Item:Q872113"

The following pages link to A level-2 reformulation-linearization technique bound for the quadratic assignment problem (Q872113):

Displaying 45 items.

• Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
• Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
• Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation (Q342082) (← links)
• Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers (Q367651) (← links)
• Using symmetry to optimize over the Sherali-Adams relaxation (Q482114) (← links)
• DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips (Q608295) (← links)
• The multi-story space assignment problem (Q610966) (← links)
• A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem (Q732777) (← links)
• Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem (Q842713) (← links)
• A survey for the quadratic assignment problem (Q852928) (← 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)
• An algorithm for the generalized quadratic assignment problem (Q1001198) (← links)
• The single-finger keyboard layout problem (Q1025249) (← links)
• Fast simulated annealing for single-row equidistant facility layout (Q1663580) (← links)
• An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations (Q1751141) (← links)
• A new lift-and-project operator (Q1752818) (← links)
• A new exact discrete linear reformulation of the quadratic assignment problem (Q1926740) (← links)
• Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
• Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering (Q2168744) (← links)
• Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints (Q2178343) (← links)
• RLT insights into lift-and-project closures (Q2257076) (← links)
• Linear programming insights into solvable cases of the quadratic assignment problem (Q2339831) (← links)
• A revised reformulation-linearization technique for the quadratic assignment problem (Q2339837) (← links)
• Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (Q2349139) (← links)
• The quadratic three-dimensional assignment problem: exact and approximate solution methods (Q2384611) (← links)
• Integrating combinatorial algorithms into a linear programming solver (Q2418164) (← links)
• Constrained 0-1 quadratic programming: basic approaches and extensions (Q2467302) (← links)
• Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting (Q2515070) (← links)
• A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices (Q2516354) (← links)
• Tightening concise linear reformulations of 0-1 cubic programs (Q2810099) (← links)
• A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem (Q2815440) (← links)
• \(L_p\)-norm regularization algorithms for optimization over permutation matrices (Q2832890) (← links)
• Exact solution of emerging quadratic assignment problems (Q3002542) (← links)
• Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (Q3406118) (← links)
• A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives (Q3466781) (← links)
• A Branch-and-Bound Algorithm for Team Formation on Social Networks (Q5085484) (← links)
• A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique (Q5131697) (← links)
• Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters (Q5139631) (← links)
• Exact Solution of Two Location Problems via Branch-and-Bound (Q5506728) (← links)
• Taking advantage of symmetry in some quadratic assignment problems (Q5884391) (← 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)