Pages that link to "Item:Q865755"
From MaRDI portal
The following pages link to A note on a polynomial time solvable case of the quadratic assignment problem (Q865755):
Displayed 5 items.
- A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems (Q1662098) (← links)
- Linear programming insights into solvable cases of the quadratic assignment problem (Q2339831) (← links)
- Exact Solution of Two Location Problems via Branch-and-Bound (Q5506728) (← 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)