Pages that link to "Item:Q1744907"
From MaRDI portal
The following pages link to Semidefinite programming approach for the quadratic assignment problem with a sparse graph (Q1744907):
Displaying 10 items.
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (Q2039245) (← links)
- A time-triggered dimension reduction algorithm for the task assignment problem (Q2095343) (← links)
- NMR assignment through linear programming (Q2131136) (← links)
- On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming (Q2220656) (← links)
- A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications (Q2414911) (← links)
- Graph separation techniques for quadratic zero-one programming (Q2638933) (← links)
- Finding graph embeddings by incremental low-rank semidefinite programming (Q3458829) (← links)
- Scalable Semidefinite Programming (Q4999352) (← links)
- Learning Markov Models Via Low-Rank Optimization (Q5106374) (← links)
- A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP (Q5106411) (← links)
