Pages that link to "Item:Q1340073"
From MaRDI portal
The following pages link to Optimal objective function approximation for separable convex quadratic programming (Q1340073):
Displaying 3 items.
- A MILP formulation for generalized geometric programming using piecewise-linear approximations (Q319582) (← links)
- An effective linear approximation method for separable programming problems (Q1036545) (← links)
- A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints (Q2802141) (← links)
