A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
From MaRDI portal
Publication:1662098
DOI10.1016/J.DISOPT.2013.02.003zbMATH Open1506.90232OpenAlexW1980190773MaRDI QIDQ1662098FDOQ1662098
Recommendations
Cites work
- scientific article; zbMATH DE number 714527 (Why is no real title available?)
- scientific article; zbMATH DE number 3451687 (Why is no real title available?)
- A contribution to quadratic assignment problems
- A note on a polynomial time solvable case of the quadratic assignment problem
- A solvable case of the quadratic assignment problem
- A survey for the quadratic assignment problem
- 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 programming for the quadratic assignment problem on trees
- Efficiently solvable cases of quadratic assignment problem with generalized monotonic and incomplete anti-Monge matrices
- Generalization of conditions for the strong solvability of a quadratic assignment problem with anti-Monge and Toeplitz matrices
- Network flows. Theory, algorithms, and applications.
- On the maximal Wiener index and related questions
- P-Complete Approximation Problems
- Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems
- Polynomial algorithms for solving the quadratic assignment problem on networks
- Room allocation: a polynomial subcase of the quadratic assignment problem
- Special cases of the quadratic assignment problem
- The Distribution of Values in the Quadratic Assignment Problem
- 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
- Using well-solvable quadratic assignment problems for VLSI interconnect applications
- Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices
Cited in
(18)- Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations
- The Rank-One Quadratic Assignment Problem
- The linearization problem of a binary quadratic problem and its applications
- An LP-based characterization of solvable QAP instances with chess-board and graded structures
- Linearizable special cases of the quadratic shortest path problem
- The constant objective value property for multidimensional assignment problems
- A characterization of linearizable instances of the quadratic minimum spanning tree problem
- Combinatorial optimization with interaction costs: complexity and solvable cases
- An \(O(n^{4})\) algorithm for the QAP linearization problem
- Linear programming insights into solvable cases of the quadratic assignment problem
- Special cases of the quadratic shortest path problem
- The quadratic cycle cover problem: special cases and efficient bounds
- The bilinear assignment problem: complexity and polynomially solvable special cases
- A linear time algorithm for linearizing quadratic and higher-order shortest path problems
- On a linearization technique for solving the quadratic set covering problem and variations
- Linearizable special cases of the QAP
- A new linearization method for quadratic assignment problems
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique
This page was built for publication: A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662098)
