An LP-based characterization of solvable QAP instances with chess-board and graded structures

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Two classes of quadratic assignment problems that are solvable as linear assignment problems
Mixed-integer bilinear programming problems
A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
A survey for the quadratic assignment problem
A note on a polynomial time solvable case of the quadratic assignment problem
A level-2 reformulation-linearization technique bound for the quadratic assignment problem
A solvable case of the quadratic assignment problem
A reformulation-linearization technique for solving discrete and continuous nonconvex problems
The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
The quadratic assignment problem. Theory and algorithms
A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
Another well-solvable case of the QAP: maximizing the job completion time variance
The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure
Solving large quadratic assignment problems on computational grids
Perspectives of Monge properties in optimization
Dynamic sparsification for quadratic assignment problems
Linear programming insights into solvable cases of the quadratic assignment problem
Well-solvable cases of the QAP with block-structured matrices
A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem
An O(n⁴) Algorithm for the QAP Linearization Problem
A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
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
Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme
Hospital Layout as a Quadratic Assignment Problem
A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique
Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems

This page was built for publication: An LP-based characterization of solvable QAP instances with chess-board and graded structures