Pages that link to "Item:Q2339831"
From MaRDI portal
The following pages link to Linear programming insights into solvable cases of the quadratic assignment problem (Q2339831):
Displaying 6 items.
- A characterization of linearizable instances of the quadratic minimum spanning tree problem (Q1702825) (← links)
- Special cases of the quadratic shortest path problem (Q1743483) (← links)
- The linearization problem of a binary quadratic problem and its applications (Q2070726) (← 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)
- Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations (Q6670500) (← links)
