Characterizing linearizable QAPs by the level-1 reformulation-linearization technique
From MaRDI portal
Recommendations
- An \(O(n^{4})\) algorithm for the QAP linearization problem
- An LP-based characterization of solvable QAP instances with chess-board and graded structures
- Linearizable special cases of the QAP
- A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
- A new linearization method for quadratic assignment problems
Cites work
- A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
- A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
- A note on a polynomial time solvable case of the quadratic assignment problem
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A revised reformulation-linearization technique for the quadratic assignment problem
- A solvable case of the quadratic assignment problem
- A survey for the quadratic assignment problem
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- An \(O(n^{4})\) algorithm for the QAP linearization problem
- Another well-solvable case of the QAP: maximizing the job completion time variance
- Assignment Problems and the Location of Economic Activities
- Dynamic sparsification for quadratic assignment problems
- Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme
- Hospital Layout as a Quadratic Assignment Problem
- scientific article; zbMATH DE number 3643044 (Why is no real title available?)
- scientific article; zbMATH DE number 5641435 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1302195 (Why is no real title available?)
- scientific article; zbMATH DE number 714526 (Why is no real title available?)
- scientific article; zbMATH DE number 714527 (Why is no real title available?)
- Linear programming insights into solvable cases of the quadratic assignment problem
- Linearizable special cases of the QAP
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Mixed-integer bilinear programming problems
- Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
- Solving large quadratic assignment problems on computational grids
- The Backboard Wiring Problem: A Placement Algorithm
- The linearization problem of a binary quadratic problem and its applications
- The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
- The quadratic assignment problem. Theory and algorithms
- The Wiener maximum quadratic assignment problem
- Two classes of quadratic assignment problems that are solvable as linear assignment problems
- Well-solvable cases of the QAP with block-structured matrices
Cited in
(4)- An LP-based characterization of solvable QAP instances with chess-board and graded structures
- A polyhedral characterization of linearizable quadratic combinatorial optimization problems
- The independent quadratic assignment problem: complexity and polynomially solvable special cases
- A linear time algorithm for linearizing quadratic and higher-order shortest path problems
This page was built for publication: Characterizing linearizable QAPs by the level-1 reformulation-linearization technique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6122081)
