Pages that link to "Item:Q1386486"
From MaRDI portal
The following pages link to Semidefinite programming relaxations for the quadratic assignment problem (Q1386486):
Displaying 50 items.
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry (Q431008) (← links)
- A polynomial time constraint-reduced algorithm for semidefinite optimization problems (Q493064) (← links)
- On improving convex quadratic programming relaxation for the quadratic assignment problem (Q498438) (← links)
- Gangster operators and invincibility of positive semidefinite matrices (Q603139) (← links)
- Semidefinite approximations for quadratic programs over orthogonal matrices (Q609564) (← links)
- Moment inequalities for sums of random matrices and their applications in optimization (Q647387) (← links)
- The MIN-cut and vertex separator problem (Q683339) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Copositive and semidefinite relaxations of the quadratic assignment problem (Q834180) (← links)
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem (Q847851) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Sums of random symmetric matrices and quadratic optimization under orthogonality constraints (Q868470) (← links)
- Bounds for the quadratic assignment problem using the bundle method (Q868474) (← links)
- Effective formulation reductions for the quadratic assignment problem (Q976022) (← links)
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs (Q977327) (← links)
- A new relaxation framework for quadratic assignment problems based on matrix splitting (Q977330) (← links)
- Exploiting special structure in semidefinite programming: a survey of theory and applications (Q1044129) (← links)
- Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming (Q1349146) (← links)
- On the Slater condition for the SDP relaxations of nonconvex sets (Q1604046) (← links)
- ADMM for the SDP relaxation of the QAP (Q1741118) (← links)
- Semidefinite programming approach for the quadratic assignment problem with a sparse graph (Q1744907) (← links)
- The demand weighted vehicle routing problem (Q1754023) (← links)
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (Q1756793) (← links)
- On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone (Q1785193) (← links)
- A note on lack of strong duality for quadratic problems with orthogonal constraints (Q1848387) (← links)
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964) (← links)
- Strong duality and minimal representations for cone optimization (Q1928754) (← links)
- Semidefinite programming relaxations for the graph partitioning problem (Q1961466) (← links)
- A proximal DC approach for quadratic assignment problem (Q2028476) (← links)
- A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem (Q2028477) (← links)
- Image matching from handcrafted to deep features: a survey (Q2056423) (← links)
- A time-triggered dimension reduction algorithm for the task assignment problem (Q2095343) (← links)
- Convex graph invariant relaxations for graph edit distance (Q2118089) (← links)
- A survey of hidden convex optimization (Q2176821) (← links)
- Semidefinite programming and eigenvalue bounds for the graph partition problem (Q2349129) (← links)
- An exact semidefinite programming approach for the max-mean dispersion problem (Q2410030) (← links)
- Local minima and convergence in low-rank semidefinite programming (Q2487849) (← links)
- Semidefinite spectral clustering (Q2507069) (← links)
- An evaluation of semidefinite programming based approaches for discrete lot-sizing problems (Q2514881) (← links)
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting (Q2515070) (← links)
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices (Q2516354) (← links)
- Efficient random graph matching via degree profiles (Q2660385) (← links)
- Lower bounds for the bandwidth problem (Q2669517) (← links)
- Minimum energy configurations on a toric lattice as a quadratic assignment problem (Q2673239) (← links)
- Relaxations of Combinatorial Problems Via Association Schemes (Q2802525) (← links)
- SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546) (← links)
