Pages that link to "Item:Q1744907"

The following pages link to Semidefinite programming approach for the quadratic assignment problem with a sparse graph (Q1744907):

Displaying 6 items.

• 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)
• 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)