Pages that link to "Item:Q1267182"

The following pages link to A solvable case of the quadratic assignment problem (Q1267182):

Displaying 19 items.

• Linearizable special cases of the QAP (Q266060) (← links)
• The three-dimensional matching problem in kalmanson matrices (Q358634) (← links)
• The Wiener maximum quadratic assignment problem (Q665991) (← links)
• Two classes of quadratic assignment problems that are solvable as linear assignment problems (Q665995) (← links)
• Selected topics on assignment problems (Q697571) (← links)
• A survey for the quadratic assignment problem (Q852928) (← links)
• A note on a polynomial time solvable case of the quadratic assignment problem (Q865755) (← links)
• A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems (Q1662098) (← links)
• The multi-stripe travelling salesman problem (Q1698268) (← links)
• Polynomially solvable cases of the bipartite traveling salesman problem (Q1752819) (← links)
• New special cases of the quadratic assignment problem with diagonally structured coefficient matrices (Q1754256) (← links)
• Another well-solvable case of the QAP: maximizing the job completion time variance (Q1758277) (← links)
• The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure (Q1785334) (← links)
• Linear programming insights into solvable cases of the quadratic assignment problem (Q2339831) (← links)
• Four-point conditions for the TSP: the complete complexity classification (Q2339841) (← links)
• Well-solvable cases of the QAP with block-structured matrices (Q2345597) (← links)
• A New Tractable Case of the QAP with a Robinson Matrix (Q5743542) (← 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)