Two classes of quadratic assignment problems that are solvable as linear assignment problems
DOI10.1016/J.DISOPT.2011.03.002zbMATH Open1233.90239OpenAlexW1964357023MaRDI QIDQ665995FDOQ665995
Publication date: 7 March 2012
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/21836
Recommendations
- Linear programming insights into solvable cases of the quadratic assignment problem
- New linearizations of quadratic assignment problems
- A solvable case of the quadratic assignment problem
- A new solution method by linearization for a special kind of quadratic assignment problem
- A new linearization method for quadratic assignment problems
- scientific article; zbMATH DE number 3982880
- A polynomially solvable class of quadratic semi-assignment problems
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
- scientific article; zbMATH DE number 1568992
computational complexitylinear assignment problemquadratic assignment problempolynomial time solvability
Combinatorial optimization (90C27) Linear-quadratic optimal control problems (49N10) Discrete location and assignment (90B80)
Cites Work
- QAPLIB - a quadratic assignment problem library
- Assignment Problems
- A solvable case of the quadratic assignment problem
- The quadratic assignment problem. Theory and algorithms
- Assignment Problems and the Location of Economic Activities
- P-Complete Approximation Problems
- The quadratic assignment problem
- Special cases of the quadratic assignment problem
- Title not available (Why is that?)
Cited In (16)
- Linearizable special cases of the QAP
- The linearization problem of a binary quadratic problem and its applications
- Title not available (Why is that?)
- Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices
- Best reduction of the quadratic semi-assignment problem
- An LP-based characterization of solvable QAP instances with chess-board and graded structures
- Linear programming insights into solvable cases of the quadratic assignment problem
- A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
- Linearizable special cases of the quadratic shortest path problem
- Quadratic assignment problems on series-parallel digraphs
- Room allocation: a polynomial subcase of the quadratic assignment problem
- Classes of quadratic assignment problem instances: Isomorphism and difficulty measure using a statistical approach
- Generating QAP instances with known optimum solution and additively decomposable cost function
- Subclasses of solvable problems from classes of combinatorial optimization problems
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique
- A linear time algorithm for linearizing quadratic and higher-order shortest path problems
Uses Software
This page was built for publication: Two classes of quadratic assignment problems that are solvable as linear assignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q665995)
