Pages that link to "Item:Q1184337"
From MaRDI portal
The following pages link to Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem (Q1184337):
Displaying 21 items.
- On improving convex quadratic programming relaxation for the quadratic assignment problem (Q498438) (← links)
- Laplace eigenvalues of graphs---a survey (Q686298) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Bounds for the quadratic assignment problem using the bundle method (Q868474) (← links)
- A new relaxation framework for quadratic assignment problems based on matrix splitting (Q977330) (← links)
- A parallel depth first search branch and bound algorithm for the quadratic assignment problem (Q1130079) (← links)
- Network-based formulations of the quadratic assignment problem (Q1291651) (← links)
- Strengthening Gilmore's bound for the quadratic assignment problem (Q1333480) (← links)
- Lower bounds for the quadratic assignment problem (Q1339141) (← links)
- A new exact algorithm for the solution of quadratic assignment problems (Q1343146) (← links)
- Best ellipsoidal relaxation to solve a nonconvex problem. (Q1421225) (← links)
- Lower bounds based on linear programming for the quadratic assignment problem (Q1804578) (← links)
- Solving the max-cut problem using eigenvalues (Q1900149) (← links)
- A projection technique for partitioning the nodes of a graph (Q1904714) (← links)
- Lower bounds for the quadratic assignment problem via triangle decompositions (Q1914071) (← links)
- A survey of hidden convex optimization (Q2176821) (← links)
- Diffusion bank networks and capital flows (Q2230764) (← links)
- Graph Similarity and Approximate Isomorphism (Q5005120) (← links)
- Norms on complex matrices induced by complete homogeneous symmetric polynomials (Q6051385) (← links)
- Sinkhorn Algorithm for Lifted Assignment Problems (Q6133998) (← links)
