Pages that link to "Item:Q266060"
From MaRDI portal
The following pages link to Linearizable special cases of the QAP (Q266060):
Displayed 9 items.
- The bilinear assignment problem: complexity and polynomially solvable special cases (Q1683688) (← links)
- 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 constant objective value property for multidimensional assignment problems (Q1751146) (← links)
- Combinatorial optimization with interaction costs: complexity and solvable cases (Q2010918) (← links)
- The linearization problem of a binary quadratic problem and its applications (Q2070726) (← links)
- Linearizable special cases of the quadratic shortest path problem (Q2672440) (← links)
- A linear time algorithm for linearizing quadratic and higher-order shortest path problems (Q6086024) (← links)
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique (Q6122081) (← links)