An implicit enumeration method for global optimization problems

DOI10.1016/0898-1221(91)90173-2zbMath0721.65037OpenAlexW2113189310MaRDI QIDQ2641085

Vera V. Kovacevic-Vujcic, Miroslav D. Asic

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

zbMATH Keywords

global optimizationlinear constraintsimplicit enumeration methodconcave linearly constrained minimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)

Related Items (1)

TABU search methodology in global optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
• Extended univariate algorithms for \(n\)-dimensional global optimization
• The cubic algorithm
• Precision, complexity, and computational schemes of the cubic algorithms
• An interior semi-infinite programming method
• Constrained global optimization: algorithms and applications
• Methods for Global Concave Minimization: A Bibliographic Survey
• An Algorithm for Separable Nonconvex Programming Problems

This page was built for publication: An implicit enumeration method for global optimization problems