Pages that link to "Item:Q1332814"

The following pages link to A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814):

Displaying 2 items.

• Nonconvex optimization over a polytope using generalized capacity improvement (Q1904646) (← links)
• Sufficient optimality criterion for linearly constrained, separable concave minimization problems (Q2569195) (← links)