Linear programming insights into solvable cases of the quadratic assignment problem
From MaRDI portal
Publication:2339831
Recommendations
- Two classes of quadratic assignment problems that are solvable as linear assignment problems
- A contribution to quadratic assignment problems
- Special cases of the quadratic assignment problem
- A new exact discrete linear reformulation of the quadratic assignment problem
- scientific article; zbMATH DE number 1803767
Cites work
- scientific article; zbMATH DE number 3643044 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (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 714527 (Why is no real title available?)
- 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
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming 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 solvable case of the quadratic assignment problem
- A survey for the quadratic assignment problem
- A unified approach to simple special cases of extremal permutation problems
- An \(O(n^{4})\) algorithm for the QAP linearization problem
- An algorithm for the quadratic assignment problem using Benders' decomposition
- Another well-solvable case of the QAP: maximizing the job completion time variance
- Assignment Problems and the Location of Economic Activities
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
- Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme
- Hospital Layout as a Quadratic Assignment Problem
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- On lower bounds for a class of quadratic 0,1 programs
- On the quadratic assignment problem
- Optimal sequencing of a set of positive numbers with the variance of the sequence's partial sums maximized
- QAPLIB - a quadratic assignment problem library
- 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 Wiener maximum quadratic assignment problem
- The quadratic assignment problem
- 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
- Two classes of quadratic assignment problems that are solvable as linear assignment problems
Cited in
(9)- The linearization problem of a binary quadratic problem and its applications
- Two classes of quadratic assignment problems that are solvable as linear assignment problems
- A characterization of linearizable instances of the quadratic minimum spanning tree problem
- An LP-based characterization of solvable QAP instances with chess-board and graded structures
- Linearizable special cases of the quadratic shortest path problem
- scientific article; zbMATH DE number 5556512 (Why is no real title available?)
- Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations
- Special cases of the quadratic shortest path problem
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique
This page was built for publication: Linear programming insights into solvable cases of the quadratic assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2339831)
