A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem
From MaRDI portal
Publication:2815440
DOI10.1287/ijoc.1110.0450zbMath1465.90086OpenAlexW2096684255MaRDI QIDQ2815440
William L. Hightower, Yi-Rong Zhu, Matthew J. Saltzman, Monique Guignard, Peter M. Hahn
Publication date: 29 June 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1110.0450
Related Items
Facility layout problem with QAP formulation under scenario-based uncertainty, Taking advantage of symmetry in some quadratic assignment problems, Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems, Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation, Fast simulated annealing for single-row equidistant facility layout, A Branch-and-Bound Algorithm for Team Formation on Social Networks, Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints, Integrating combinatorial algorithms into a linear programming solver, Characterizing linearizable QAPs by the level-1 reformulation-linearization technique, Sinkhorn Algorithm for Lifted Assignment Problems, An LP-based characterization of solvable QAP instances with chess-board and graded structures, A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique, Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters, Using symmetry to optimize over the Sherali-Adams relaxation, RLT insights into lift-and-project closures, 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, A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices, Linear programming insights into solvable cases of the quadratic assignment problem, A revised reformulation-linearization technique for the quadratic assignment problem, Cutting planes for RLT relaxations of mixed 0-1 polynomial programs, Finding optimal solutions to several gray pattern instances
Uses Software
Cites Work
- Unnamed Item
- A survey for the quadratic assignment problem
- Bounds for the quadratic assignment problem using the bundle method
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
- A dual framework for lower bounds of the quadratic assignment problem based on linearization
- Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation
- 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
- 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
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- A new bound for the quadratic assignment problem based on convex quadratic programming
