The following pages link to (Q4247438):
Displaying 9 items.
- Conic relaxations for semi-supervised support vector machines (Q289094) (← links)
- Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition (Q415403) (← links)
- Continuous reformulations for zero-one programming problems (Q415420) (← links)
- Analysis of penalty parameters in binary constrained extremum problems (Q514709) (← links)
- On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope (Q650234) (← links)
- Existence and sum decomposition of vertex polyhedral convex envelopes (Q941026) (← links)
- Improved penalty algorithm for mixed integer PDE constrained optimization problems (Q2147266) (← links)
- Disnel: An application package for solving discrete and nonlinear optimization problems (Q4007358) (← links)
- A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems (Q5060789) (← links)
