An implicit enumeration method for global optimization problems
DOI10.1016/0898-1221(91)90173-2zbMATH Open0721.65037OpenAlexW2113189310MaRDI QIDQ2641085FDOQ2641085
Authors: Miroslav D. Asic, Vera Kovačević-Vujčić 
Publication date: 1991
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(91)90173-2
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
global optimizationlinear constraintsimplicit enumeration methodconcave linearly constrained minimization
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)
Cites Work
- Constrained global optimization: algorithms and applications
- An Algorithm for Separable Nonconvex Programming Problems
- Methods for Global Concave Minimization: A Bibliographic Survey
- Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
- The cubic algorithm
- Extended univariate algorithms for \(n\)-dimensional global optimization
- Precision, complexity, and computational schemes of the cubic algorithms
- Title not available (Why is that?)
- An interior semi-infinite programming method
- Title not available (Why is that?)
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)
