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 18 items.
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry (Q431008) (← links)
- On improving convex quadratic programming relaxation for the quadratic assignment problem (Q498438) (← links)
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem (Q847851) (← links)
- Semidefinite programming relaxations for the quadratic assignment problem (Q1386486) (← links)
- 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)
- On the gap between the quadratic integer programming problem and its semidefinite relaxation (Q2492705) (← links)
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting (Q2515070) (← links)
- Eigenvalue bounds versus semidefinite relaxations for the quadratic assignment problem (Q2706327) (← links)
- Solving quadratic assignment problems using convex quadratic programming relaxations (Q2774598) (← links)
- A New Matrix Splitting Based Relaxation for the Quadratic Assignment Problem (Q2807873) (← links)
- A Low-Dimensional Semidefinite Relaxation for the Quadratic Assignment Problem (Q3169078) (← links)
- Convex quadratic and semidefinite programming relaxations in scheduling (Q3196615) (← links)
- (Q3437319) (← 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)
