Pages that link to "Item:Q3664835"

The following pages link to Computational aspects of two-segment separable programming (Q3664835):

Displaying 10 items.

• Controlled predatory pricing in a multiperiod Stackelberg game: an MPEC approach (Q540710) (← links)
• Cross decomposition applied to the stochastic transportation problem (Q799587) (← links)
• Competitive facility location model with concave demand (Q877034) (← links)
• Global minimization of indefinite quadratic problems (Q1092620) (← links)
• The empirical performance of a polynomial algorithm for constrained nonlinear optimization (Q1309871) (← links)
• Optimal objective function approximation for separable convex quadratic programming (Q1340073) (← links)
• A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints (Q2802141) (← links)
• Computational aspects of two-segment separable programming (Q3664835) (← links)
• Reduction of nonlinear integer separable programming problems^∗ (Q3807881) (← links)
• Sandwich approximation of univariate convex functions with an application to separable convex programming (Q3987782) (← links)