Pages that link to "Item:Q5930731"
From MaRDI portal
The following pages link to A new bound for the quadratic assignment problem based on convex quadratic programming (Q5930731):
Displayed 27 items.
- On improving convex quadratic programming relaxation for the quadratic assignment problem (Q498438) (← links)
- The MIN-cut and vertex separator problem (Q683339) (← links)
- Sufficient global optimality conditions for bivalent quadratic optimization (Q702386) (← links)
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Bounds for the quadratic assignment problem using the bundle method (Q868474) (← links)
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem (Q872113) (← links)
- Mapping the convergence of genetic algorithms (Q955480) (← links)
- A new relaxation framework for quadratic assignment problems based on matrix splitting (Q977330) (← links)
- An algorithm for the generalized quadratic assignment problem (Q1001198) (← links)
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
- ADMM for the SDP relaxation of the QAP (Q1741118) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- A performance guarantee heuristic for electronic components placement problems including thermal effects (Q1781568) (← links)
- A note on lack of strong duality for quadratic problems with orthogonal constraints (Q1848387) (← links)
- A new exact discrete linear reformulation of the quadratic assignment problem (Q1926740) (← links)
- On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope (Q2288199) (← links)
- A revised reformulation-linearization technique for the quadratic assignment problem (Q2339837) (← links)
- An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting (Q2515070) (← links)
- Minimum energy configurations on a toric lattice as a quadratic assignment problem (Q2673239) (← links)
- SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546) (← links)
- A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem (Q2815440) (← links)
- A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives (Q3466781) (← links)
- Taking advantage of symmetry in some quadratic assignment problems (Q5884391) (← links)
- Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem (Q5963676) (← links)
- Sinkhorn Algorithm for Lifted Assignment Problems (Q6133998) (← links)