Pages that link to "Item:Q1904646"

The following pages link to Nonconvex optimization over a polytope using generalized capacity improvement (Q1904646):

Displaying 2 items.

• A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems (Q2503087) (← links)
• Sufficient optimality criterion for linearly constrained, separable concave minimization problems (Q2569195) (← links)