Pages that link to "Item:Q2996038"
From MaRDI portal
The following pages link to Polynomial algorithms for solving the quadratic assignment problem on networks (Q2996038):
Displaying 4 items.
- A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems (Q1662098) (← links)
- Dynamic programming for the quadratic assignment problem on trees (Q2261718) (← links)
- POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION (Q3646206) (← links)
- Polynomial algorithms for the synthesis of bounded nets (Q5096743) (← links)