Pages that link to "Item:Q1662098"

The following pages link to A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems (Q1662098):

Displaying 14 items.

• Linearizable special cases of the QAP (Q266060) (← links)
• On a linearization technique for solving the quadratic set covering problem and variations (Q1676486) (← links)
• The bilinear assignment problem: complexity and polynomially solvable special cases (Q1683688) (← links)
• A characterization of linearizable instances of the quadratic minimum spanning tree problem (Q1702825) (← links)
• Special cases of the quadratic shortest path problem (Q1743483) (← links)
• The constant objective value property for multidimensional assignment problems (Q1751146) (← links)
• Combinatorial optimization with interaction costs: complexity and solvable cases (Q2010918) (← links)
• The linearization problem of a binary quadratic problem and its applications (Q2070726) (← links)
• The quadratic cycle cover problem: special cases and efficient bounds (Q2175054) (← 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)
• The Rank-One Quadratic Assignment Problem (Q5085471) (← 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)