Pages that link to "Item:Q1810868"
From MaRDI portal
The following pages link to Some fundamental properties of successive convex relaxation methods on LCP and related problems (Q1810868):
Displaying 3 items.
- A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs (Q1752600) (← links)
- Convexification techniques for linear complementarity constraints (Q2045009) (← links)
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations (Q2476994) (← links)
