90 Operations research, mathematical programming
90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut (3 articles)
-
Singh, Vikram; Sun, Min:
An algorithm for cardinality-constrained optimization with an application to the best subset selection and sparse portfolio problems.
(English).
Kybernetika,
vol. 62
(2026),
issue 3,
pp. 373-399
-
Scitovski, Rudolf; Sabo, Kristian:
The adaptation of the $k$-means algorithm to solving the multiple ellipses detection problem by using an initial approximation obtained by the DIRECT global optimization algorithm.
(English).
Applications of Mathematics,
vol. 64
(2019),
issue 6,
pp. 663-678
-
Černý, Michal:
Goffin's algorithm for zonotopes.
(English).
Kybernetika,
vol. 48
(2012),
issue 5,
pp. 890-906