A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
From MaRDI portal
Publication:2815440
DOI10.1287/IJOC.1110.0450zbMATH Open1465.90086OpenAlexW2096684255MaRDI QIDQ2815440FDOQ2815440
Authors: Yi-Rong Zhu, Monique Guignard, William L. Hightower, Matthew J. Saltzman, 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
Recommendations
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- A revised reformulation-linearization technique for the quadratic assignment problem
- scientific article; zbMATH DE number 1795730
- scientific article; zbMATH DE number 714527
- scientific article; zbMATH DE number 970341
Cites Work
- 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
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- A survey for the quadratic assignment problem
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- Lower bounds for the quadratic assignment problem based upon a dual formulation
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
- A new bound for the quadratic assignment problem based on convex quadratic programming
- Bounds for the quadratic assignment problem using the bundle method
- A dual framework for lower bounds of the quadratic assignment problem based on linearization
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
- Title not available (Why is that?)
Cited In (24)
- RLT insights into lift-and-project closures
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
- Integrating combinatorial algorithms into a linear programming solver
- Finding optimal solutions to several gray pattern instances
- Title not available (Why is that?)
- An LP-based characterization of solvable QAP instances with chess-board and graded structures
- Linear programming insights into solvable cases of the quadratic assignment problem
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
- A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
- Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation
- Taking advantage of symmetry in some quadratic assignment problems
- A Branch-and-Bound Algorithm for Team Formation on Social Networks
- Sinkhorn Algorithm for Lifted Assignment Problems
- Using symmetry to optimize over the Sherali-Adams relaxation
- Fast simulated annealing for single-row equidistant facility layout
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices
- Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
- Facility layout problem with QAP formulation under scenario-based uncertainty
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique
- A revised reformulation-linearization technique for the quadratic assignment problem
Uses Software
This page was built for publication: A level-3 reformulation-linearization technique-based 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 Q2815440)
