A revised reformulation-linearization technique for the quadratic assignment problem

DOI10.1016/j.disopt.2014.08.003zbMath1308.90123OpenAlexW1978805957MaRDI QIDQ2339837

Federico Malucelli, Borzou Rostami

Publication date: 9 April 2015

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2014.08.003

zbMATH Keywords

quadratic assignment problemlower bounddual ascentreformulation-linearization technique

Mathematics Subject Classification ID

Mixed integer programming (90C11) Quadratic programming (90C20) Discrete location and assignment (90B80) Boolean programming (90C09)

Related Items (6)

Facility layout problem with QAP formulation under scenario-based uncertainty ⋮ Lower bounding procedure for the asymmetric quadratic traveling salesman 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 ⋮ Sinkhorn Algorithm for Lifted Assignment Problems ⋮ A generalized Gilmore-Lawler procedure for the quadratic assignment problem

Uses Software

• QAPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a special case of the quadratic assignment problem with an application to storage-and-retrieval devices
• A survey for the quadratic assignment problem
• A level-2 reformulation-linearization technique bound for the quadratic assignment problem
• On the quadratic assignment problem
• QAPLIB - a quadratic assignment problem library
• A dual framework for lower bounds of the quadratic assignment problem based on linearization
• Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
• Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation
• The Quadratic Assignment Problem
• A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem
• The Backboard Wiring Problem: A Placement Algorithm
• Assignment Problems and the Location of Economic Activities
• A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
• A New Lower Bound for the Quadratic Assignment Problem
• Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
• 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
• A new bound for the quadratic assignment problem based on convex quadratic programming

This page was built for publication: A revised reformulation-linearization technique for the quadratic assignment problem