Pages that link to "Item:Q1928496"
From MaRDI portal
The following pages link to Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA (Q1928496):
Displaying 5 items.
- DC approximation approaches for sparse optimization (Q319281) (← links)
- Bank supervision using the threshold-minimum dominating set (Q1619369) (← links)
- DC programming and DCA: thirty years of developments (Q1749443) (← links)
- A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model (Q2230777) (← links)
- DC Programming and DCA for General DC Programs (Q3192952) (← links)
