| Publication | Date of Publication | Type |
|---|
Local search versus linear programming to detect monotonicity in simplicial branch and bound
Journal of Global Optimization | 2025-03-04 | Paper |
On dealing with minima at the border of a simplicial feasible area in simplicial branch and bound
Journal of Optimization Theory and Applications | 2024-11-27 | Paper |
On monotonicity and search strategies in face-based copositivity detection algorithms
CEJOR. Central European Journal of Operations Research | 2022-07-15 | Paper |
On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic
Journal of Global Optimization | 2021-08-17 | Paper |
On derivative based bounding for simplicial branch and bound
RAIRO - Operations Research | 2021-07-19 | Paper |
On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization
Applied Mathematics and Computation | 2021-03-31 | Paper |
| scientific article; zbMATH DE number 6869275 (Why is no real title available?) | 2018-05-17 | Paper |
| On the minimum number of simplex shapes in longest edge bisection refinement of a regular n-simplex | 2018-05-11 | Paper |
On parallel branch and bound frameworks for global optimization
Journal of Global Optimization | 2017-12-07 | Paper |
Non-dominated sorting procedure for Pareto dominance ranking on multicore CPU and/or GPU
Journal of Global Optimization | 2017-12-07 | Paper |
Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement
Journal of Combinatorial Optimization | 2017-02-22 | Paper |
On refinement of the unit simplex using regular simplices
Journal of Global Optimization | 2016-02-29 | Paper |
Pareto optimality and robustness in bi-blending problems
Top | 2014-10-08 | Paper |
Erratum to: ``Pareto optimality and robustness in bi-blending problems''
Top | 2014-10-08 | Paper |
On estimating workload in interval branch-and-bound global optimization algorithms
Journal of Global Optimization | 2013-08-01 | Paper |
On interval branch-and-bound for additively separable functions with common variables
Journal of Global Optimization | 2013-08-01 | Paper |
| Group oriented renewal of secrets and its application to secure multicast | 2012-10-26 | Paper |
Asynchronous privacy-preserving iterative computation on peer-to-peer networks
Computing | 2012-10-23 | Paper |
A suite of algorithms for key distribution and authentication in centralized secure multicast environments
Journal of Computational and Applied Mathematics | 2012-05-11 | Paper |
On determining the cover of a simplex by spheres centered at its vertices
Journal of Global Optimization | 2011-11-08 | Paper |
The semi-continuous quadratic mixture design problem: description and branch-and-bound approach
European Journal of Operational Research | 2008-07-10 | Paper |
Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
Journal of Global Optimization | 2008-06-03 | Paper |
Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm
Journal of Global Optimization | 2007-11-14 | Paper |
New approaches to circle packing in a square. With program codes.
Springer Optimization and Its Applications | 2006-12-27 | Paper |
New interval methods for constrained global optimization
Mathematical Programming. Series A. Series B | 2006-05-02 | Paper |
Heuristic rejection in interval global optimization
Journal of Optimization Theory and Applications | 2003-09-15 | Paper |
Interval Algorithms for Finding the Minimal Root in a Set of Multiextremal One-Dimensional Nondifferentiable Functions
SIAM Journal on Scientific Computing | 2003-01-05 | Paper |
A heuristic rejection criterion in interval global optimization algorithms
BIT | 2002-09-19 | Paper |
| scientific article; zbMATH DE number 1748532 (Why is no real title available?) | 2002-06-03 | Paper |
| scientific article; zbMATH DE number 1748533 (Why is no real title available?) | 2002-06-03 | Paper |
Experiments with a new selection criterion in a fast interval optimization algorithm
Journal of Global Optimization | 2001-09-23 | Paper |
A new multisection technique in interval methods for global optimization
Computing | 2001-08-21 | Paper |
Interval branch and bound algorithm for finding the first-zero-crossing-point in one-dimensional functions
Reliable Computing | 2001-03-28 | Paper |
| scientific article; zbMATH DE number 1058966 (Why is no real title available?) | 1998-02-26 | Paper |
