Pages that link to "Item:Q987514"

The following pages link to Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint (Q987514):

Displaying 3 items.

• On optimization over the efficient set of a multiple objective linear programming problem (Q511973) (← links)
• Time-optimal velocity planning by a bound-tightening technique (Q1753068) (← links)
• Separable concave minimization via partial outer approximation and branch and bound (Q2277369) (← links)