Pages that link to "Item:Q853797"
From MaRDI portal
The following pages link to Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices (Q853797):
Displaying 15 items.
- Polynomially solvable special cases of the quadratic bottleneck assignment problem (Q411238) (← links)
- Using well-solvable quadratic assignment problems for VLSI interconnect applications (Q412356) (← links)
- A solvable case of the quadratic assignment problem (Q1267182) (← links)
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases (Q1290637) (← 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)
- 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)
- Dynamic programming for the quadratic assignment problem on trees (Q2261718) (← links)
- A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem (Q2267269) (← links)
- A new algorithm for solving a special matching problem with a general form value function under constraints (Q2287164) (← links)
- Well-solvable cases of the QAP with block-structured matrices (Q2345597) (← 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)
- Quadratic assignment problems with additively monotone matrices and incomplete anti-Monge matrices: conditions for effective solvability (Q5439039) (← links)
