A level-2 reformulation-linearization technique bound for the quadratic assignment problem
From MaRDI portal
Recommendations
- A revised reformulation-linearization technique for the quadratic assignment problem
- A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
- scientific article; zbMATH DE number 714527
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
- scientific article; zbMATH DE number 4027174
Cites work
- scientific article; zbMATH DE number 714527 (Why is no real title available?)
- scientific article; zbMATH DE number 2049005 (Why is no real title available?)
- scientific article; zbMATH DE number 2049010 (Why is no real title available?)
- scientific article; zbMATH DE number 1795730 (Why is no real title available?)
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A new bound for the quadratic assignment problem based on convex quadratic programming
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Lower bounds for the quadratic assignment problem based upon a dual formulation
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
- QAPLIB-A quadratic assignment problem library
- Solving large quadratic assignment problems on computational grids
- Solving quadratic assignment problems using convex quadratic programming relaxations
- The quadratic assignment problem
Cited in
(45)- An LP-based characterization of solvable QAP instances with chess-board and graded structures
- Integrating combinatorial algorithms into a linear programming solver
- Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters
- The multi-story space assignment problem
- RLT insights into lift-and-project closures
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices
- Exact solution of two location problems via branch-and-bound
- Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem
- Taking advantage of symmetry in some quadratic assignment problems
- Linear programming insights into solvable cases of the quadratic assignment problem
- Constrained 0-1 quadratic programming: basic approaches and extensions
- The single-finger keyboard layout problem
- A survey for the quadratic assignment problem
- A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique
- Fast simulated annealing for single-row equidistant facility layout
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
- Concise RLT forms of binary programs: a computational study of the quadratic knapsack problem
- Exact solution of emerging quadratic assignment problems
- A new exact discrete linear reformulation of the quadratic assignment problem
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips
- \(L_p\)-norm regularization algorithms for optimization over permutation matrices
- A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
- A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
- Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints
- Mapping the convergence of genetic algorithms
- A Branch-and-Bound Algorithm for Team Formation on Social Networks
- An algorithm for the generalized quadratic assignment problem
- A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- Tightening concise linear reformulations of 0-1 cubic programs
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
- Effective formulation reductions for the quadratic assignment problem
- Using symmetry to optimize over the Sherali-Adams relaxation
- Sinkhorn Algorithm for Lifted Assignment Problems
- A new lift-and-project operator
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
- A revised reformulation-linearization technique for the quadratic assignment problem
- Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique
- Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
This page was built for publication: A level-2 reformulation-linearization technique bound for the quadratic assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q872113)
