The following pages link to (Q4880749):
Displayed 8 items.
- Modified \(r\)-algorithm to find the global minimum of polynomial functions (Q1280905) (← links)
- Main directions in the development of informatics (Q1280975) (← links)
- Modified cutting plane method for minimization of a convex function (Q1280984) (← links)
- Mixed method for solving the general convex programming problem (Q1288666) (← links)
- A surrogate heuristic for set covering problems (Q1342046) (← links)
- Matrix mathematical programming problems (Q1364090) (← links)
- Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs (Q2564623) (← links)
- Variants to the cutting plane approach for convex nondifferentiable optimization (Q4327932) (← links)