Pages that link to "Item:Q2515070"
From MaRDI portal
The following pages link to Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting (Q2515070):
Displaying 4 items.
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← links)
- Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties (Q4995064) (← links)
- Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters (Q5139631) (← links)
- An effective global algorithm for worst-case linear optimization under polyhedral uncertainty (Q6166102) (← links)
