Pages that link to "Item:Q1290637"

The following pages link to The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases (Q1290637):

Displaying 34 items.

• Linearizable special cases of the QAP (Q266060) (← links)
• Using well-solvable quadratic assignment problems for VLSI interconnect applications (Q412356) (← links)
• The Wiener maximum quadratic assignment problem (Q665991) (← links)
• Selected topics on assignment problems (Q697571) (← links)
• Optimal wire ordering and spacing in low power semiconductor design (Q847831) (← links)
• A survey for the quadratic assignment problem (Q852928) (← links)
• Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices (Q853797) (← links)
• A note on a polynomial time solvable case of the quadratic assignment problem (Q865755) (← links)
• The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases (Q1290637) (← links)
• Efficiently solvable special cases of hard combinatorial optimization problems (Q1365047) (← links)
• The doubly graded matrix cone and Ferrers matrices (Q1399239) (← links)
• A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems (Q1662098) (← links)
• The bilinear assignment problem: complexity and polynomially solvable special cases (Q1683688) (← links)
• The multi-stripe travelling salesman problem (Q1698268) (← 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)
• Perspectives of Monge properties in optimization (Q1923588) (← links)
• String shuffle: circuits and graphs (Q2018545) (← links)
• Dynamic programming for the quadratic assignment problem on trees (Q2261718) (← links)
• A new algorithm for solving a special matching problem with a general form value function under constraints (Q2287164) (← links)
• Linear programming insights into solvable cases of the quadratic assignment problem (Q2339831) (← links)
• Well-solvable cases of the QAP with block-structured matrices (Q2345597) (← links)
• Robinsonian matrices: recognition challenges (Q2403299) (← links)
• A parallel water flow algorithm with local search for solving the quadratic assignment problem (Q2423282) (← links)
• Efficiently solvable cases of quadratic assignment problem with generalized monotonic and incomplete anti-Monge matrices (Q2458114) (← links)
• Unshuffling a square is NP-hard (Q2637646) (← links)
• Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms (Q3386794) (← links)
• A unified approach to simple special cases of extremal permutation problems (Q4227985) (← links)
• Graph Similarity and Approximate Isomorphism (Q5005120) (← links)
• Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
• Characterizing linearizable QAPs by the level-1 reformulation-linearization technique (Q6122081) (← links)
• One-Dimensional Carousel Storage Problems: Applications, Review and Generalizations (Q6160198) (← links)
• An LP-based characterization of solvable QAP instances with chess-board and graded structures (Q6168180) (← links)