An implicit enumeration method for global optimization problems
From MaRDI portal
Publication:2641085
Recommendations
- Piyavskij's method for solving the general global optimization problem
- Linearly constrained global optimization: a general solution algorithm with applications.
- Enumerative techniques for solving some nonconvex global optimization problems
- Global optimization under Lipschitzian constraints
- scientific article; zbMATH DE number 47153
Cites work
- scientific article; zbMATH DE number 4001882 (Why is no real title available?)
- scientific article; zbMATH DE number 4048903 (Why is no real title available?)
- An Algorithm for Separable Nonconvex Programming Problems
- An interior semi-infinite programming method
- Constrained global optimization: algorithms and applications
- Extended univariate algorithms for \(n\)-dimensional global optimization
- Methods for Global Concave Minimization: A Bibliographic Survey
- Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
- Precision, complexity, and computational schemes of the cubic algorithms
- The cubic algorithm
Cited in
(4)
This page was built for publication: An implicit enumeration method for global optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2641085)