Publication:4880749
From MaRDI portal
zbMath0998.90527MaRDI QIDQ4880749
Publication date: 18 July 1996
Related Items
Variants to the cutting plane approach for convex nondifferentiable optimization, Modified \(r\)-algorithm to find the global minimum of polynomial functions, Main directions in the development of informatics, Modified cutting plane method for minimization of a convex function, Mixed method for solving the general convex programming problem, A surrogate heuristic for set covering problems, Matrix mathematical programming problems, Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs