Helder Manoel Venceslau
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Helder Manoel Venceslau has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Nelson Maculan
Systems Engineering and Computer Science Program-Applied Mathematics (COPPE/IM), Federal University of Rio de Janeiro, Rio de Janeiro, Brazil
3 shared publications - Adilson Elias Xavier
Federal University of Rio de Janeiro
2 shared publications Andre Luiz Cordeiro dos Santos
1 shared publicationDaniela Cristina Lubke
Department of Systems Engineering and Computer Science, Graduate School of Engineering (COPPE), Federal University of Rio de Janeiro, 21941-972, Rio de Janeiro, PO Box 68511 RJ, Brazil
1 shared publication- Felipe Marques dos Santos
Marine Autonomous and Robotic Systems National Oceanography Centre Southampton (NOCS) Southampton UK
1 shared publication Gustavo Dias
Ecole Polytech, LIX, F-91128 Palaiseau, France
1 shared publication
Latest Publications
- Open Access
- 26 June 2025
- Published by Elsevier in Ocean Modelling
- Vol. 197
The Controlled Four-Parameter Method for cross-assignment of directional wave systems
- 26 June 2025
- Published by Elsevier in Ocean Modelling
- Vol. 197
Open AccessThe Controlled Four-Parameter Method for cross-assignment of directional wave systems
- 2 March 2021
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 55, S787-S810
A new penalty/stochastic approach to an application of the covering problem: The gamma knife treatment
The covering problem of a three dimensional body using different radii spheres is considered. The motivating application – the treatment planning of Gamma Knife radiosurgery – is briefly discussed. We approach the problem only by the geometric covering point of view, that is, given a set of spheres and a body, the objective is to cover the body using the smallest possible number of spheres, regardless of the dosage issue. In order to solve this mathematical programming problem, we consider an approach based on the application of penalty and stochastic local search techniques. Finally, some illustrative results and comparisons are presented.
- 2 March 2021
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 55, S787-S810
A new penalty/stochastic approach to an application of the covering problem: The gamma knife treatment
The covering problem of a three dimensional body using different radii spheres is considered. The motivating application – the treatment planning of Gamma Knife radiosurgery – is briefly discussed. We approach the problem only by the geometric covering point of view, that is, given a set of spheres and a body, the objective is to cover the body using the smallest possible number of spheres, regardless of the dosage issue. In order to solve this mathematical programming problem, we consider an approach based on the application of penalty and stochastic local search techniques. Finally, some illustrative results and comparisons are presented.
- 1 January 2020
- Published by Springer Nature in Matemática Contemporânea
- Vol. 46 (13)
Covering a body using unequal spheres and the problem of finding covering holes
- 1 January 2020
- Published by Springer Nature in Matemática Contemporânea
- Vol. 46 (13)
Covering a body using unequal spheres and the problem of finding covering holes
- 12 January 2016
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 50 (1) , 157-173
A geometric perspective of the Weiszfeld algorithm for solving the Fermat−Weber problem
The Fermat−Weber problem is a classical location problem that has the Weiszfeld algorithm as its main iterative solution method. This article presents a geometric interpretation of its local convergence for the particular case of three points, with the solution constrained to be an interior point, which is fundamental to the present geometric interpretation. This constraint, on the other hand, implies that the weights associated to each point must obey triangle inequalities. The eigenvalues analysis is developed considering that all weights have the same value, which simplifies calculation and explanation, but the generalization of this analysis is straightforward, as commented in the text. Step-size scaling is also considered for accelerating the convergence rate. The accompanying eigenvalues analysis determines step-size multiplier ranges that ensure convergence. Moreover, the eigenvalues depend on a parameter that is computed based on the sample points configuration.
- 12 January 2016
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 50 (1) , 157-173
A geometric perspective of the Weiszfeld algorithm for solving the Fermat−Weber problem
The Fermat−Weber problem is a classical location problem that has the Weiszfeld algorithm as its main iterative solution method. This article presents a geometric interpretation of its local convergence for the particular case of three points, with the solution constrained to be an interior point, which is fundamental to the present geometric interpretation. This constraint, on the other hand, implies that the weights associated to each point must obey triangle inequalities. The eigenvalues analysis is developed considering that all weights have the same value, which simplifies calculation and explanation, but the generalization of this analysis is straightforward, as commented in the text. Step-size scaling is also considered for accelerating the convergence rate. The accompanying eigenvalues analysis determines step-size multiplier ranges that ensure convergence. Moreover, the eigenvalues depend on a parameter that is computed based on the sample points configuration.
- 23 July 2014
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 30 (2) , 391-403
Optimal covering of solid bodies by spheres via the hyperbolic smoothing technique
We consider the problem of optimally covering solid bodies by a given number of spheres. The mathematical modelling of this problem leads to a min–max–min formulation which, in addition to its intrinsic multi-level nature, has the significant characteristic of being non-differentiable. The use of the hyperbolic smoothing technique engenders a simple one-level nonlinear programming problem and allows overcoming the main difficulties presented by the original one. To illustrate the performance of the method we present computational results for two large test covering problems with up to 1,200,000 voxels. The first problem is the covering of a ring torus whose optimal solution is known whenever the number of covering spheres is small, and the second problem is a generic test problem.
- 23 July 2014
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 30 (2) , 391-403
Optimal covering of solid bodies by spheres via the hyperbolic smoothing technique
We consider the problem of optimally covering solid bodies by a given number of spheres. The mathematical modelling of this problem leads to a min–max–min formulation which, in addition to its intrinsic multi-level nature, has the significant characteristic of being non-differentiable. The use of the hyperbolic smoothing technique engenders a simple one-level nonlinear programming problem and allows overcoming the main difficulties presented by the original one. To illustrate the performance of the method we present computational results for two large test covering problems with up to 1,200,000 voxels. The first problem is the covering of a ring torus whose optimal solution is known whenever the number of covering spheres is small, and the second problem is a generic test problem.