Pages that link to "Item:Q1758277"
From MaRDI portal
The following pages link to Another well-solvable case of the QAP: maximizing the job completion time variance (Q1758277):
Displayed 11 items.
- Linearizable special cases of the QAP (Q266060) (← links)
- A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems (Q1662098) (← links)
- New special cases of the quadratic assignment problem with diagonally structured coefficient matrices (Q1754256) (← links)
- Using well-solvable minimum cost exact covering for VLSI clock energy minimization (Q1785247) (← 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)
- Robinsonian matrices: recognition challenges (Q2403299) (← 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)