Pages that link to "Item:Q498438"
From MaRDI portal
The following pages link to On improving convex quadratic programming relaxation for the quadratic assignment problem (Q498438):
Displaying 10 items.
- Convex hull of the orthogonal similarity set with applications in quadratic assignment problems (Q380503) (← links)
- A new relaxation framework for quadratic assignment problems based on matrix splitting (Q977330) (← 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)
- Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem (Q2958360) (← links)
- Convex quadratic and semidefinite programming relaxations in scheduling (Q3196615) (← links)
- (Q3437319) (← links)
- Second order cone programming relaxation for quadratic assignment problems (Q3514847) (← links)
- Convex Relaxations of (0, 1)-Quadratic Programming (Q4864871) (← links)
- A new bound for the quadratic assignment problem based on convex quadratic programming (Q5930731) (← links)