Pages that link to "Item:Q977330"
From MaRDI portal
The following pages link to A new relaxation framework for quadratic assignment problems based on matrix splitting (Q977330):
Displaying 8 items.
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers (Q367651) (← links)
- Semidefinite programming approach for the quadratic assignment problem with a sparse graph (Q1744907) (← links)
- A new exact discrete linear reformulation of the quadratic assignment problem (Q1926740) (← links)
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting (Q2515070) (← links)
- On solving a hard quadratic 3-dimensional assignment problem (Q2516353) (← links)
- A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases (Q2835697) (← links)
- On New Classes of Nonnegative Symmetric Tensors (Q2968174) (← links)
- A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique (Q5131697) (← links)
