Pages that link to "Item:Q2458114"
From MaRDI portal
The following pages link to Efficiently solvable cases of quadratic assignment problem with generalized monotonic and incomplete anti-Monge matrices (Q2458114):
Displaying 7 items.
- Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices (Q853797) (← links)
- Subclasses of solvable problems from classes of combinatorial optimization problems (Q1040379) (← links)
- A solvable case of the quadratic assignment problem (Q1267182) (← links)
- A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems (Q1662098) (← 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)
- Quadratic assignment problems with additively monotone matrices and incomplete anti-Monge matrices: conditions for effective solvability (Q5439039) (← links)