Pages that link to "Item:Q665995"

The following pages link to Two classes of quadratic assignment problems that are solvable as linear assignment problems (Q665995):

Displaying 16 items.

• Linearizable special cases of the QAP (Q266060) (← links)
• Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices (Q853797) (← links)
• Generating QAP instances with known optimum solution and additively decomposable cost function (Q887857) (← links)
• Subclasses of solvable problems from classes of combinatorial optimization problems (Q1040379) (← links)
• Special cases of the quadratic assignment problem (Q1129914) (← links)
• A polynomially solvable class of quadratic semi-assignment problems (Q1278260) (← links)
• A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems (Q1662098) (← links)
• Room allocation: a polynomial subcase of the quadratic assignment problem (Q1765233) (← links)
• Classes of quadratic assignment problem instances: Isomorphism and difficulty measure using a statistical approach (Q1850122) (← links)
• The linearization problem of a binary quadratic problem and its applications (Q2070726) (← links)
• Linear programming insights into solvable cases of the quadratic assignment problem (Q2339831) (← links)
• Linearizable special cases of the quadratic shortest path problem (Q2672440) (← links)
• An \(O(n^{4})\) algorithm for the QAP linearization problem (Q2884300) (← links)
• Best reduction of the quadratic semi-assignment problem (Q5931788) (← links)
• Characterizing linearizable QAPs by the level-1 reformulation-linearization technique (Q6122081) (← links)
• An LP-based characterization of solvable QAP instances with chess-board and graded structures (Q6168180) (← links)