Pages that link to "Item:Q3466781"
From MaRDI portal
The following pages link to A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives (Q3466781):
Displaying 6 items.
- Semidefinite programming approach for the quadratic assignment problem with a sparse graph (Q1744907) (← links)
- A time-triggered dimension reduction algorithm for the task assignment problem (Q2095343) (← links)
- Task assignment in tree-like hierarchical structures (Q2410113) (← links)
- A guide to conic optimisation and its applications (Q4634309) (← links)
- A Branch-and-Bound Algorithm for Team Formation on Social Networks (Q5085484) (← links)
- Quadratic Combinatorial Optimization Using Separable Underestimators (Q5136070) (← links)
