Pages that link to "Item:Q2261718"
From MaRDI portal
The following pages link to Dynamic programming for the quadratic assignment problem on trees (Q2261718):
Displaying 4 items.
- Algorithm for the discrete Weber's problem with an accuracy estimate (Q329214) (← links)
- On a quadratic programming problem involving distances in trees (Q338937) (← links)
- A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems (Q1662098) (← links)
- Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem (Q4427381) (← links)