Ernesto G. Birgin
Orcid: 0000-0002-7466-7663
According to our database1,
Ernesto G. Birgin
authored at least 84 papers
between 2000 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on d-nb.info
On csauthors.net:
Bibliography
2024
Numer. Algorithms, May, 2024
2023
A forward-looking matheuristic approach for the multi-period two-dimensional non-guillotine cutting stock problem with usable leftovers.
Expert Syst. Appl., August, 2023
Relax-and-Fix Heuristics Applied to a Real-World Lot Sizing and Scheduling Problem in the Personal Care Consumer Goods Industry.
Oper. Res. Forum, June, 2023
Math. Comput., June, 2023
2022
Secant Acceleration of Sequential Residual Methods for Solving Large-Scale Nonlinear Systems of Equations.
SIAM J. Numer. Anal., December, 2022
SIAM J. Sci. Comput., 2022
Optim. Methods Softw., 2022
On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization.
J. Glob. Optim., 2022
Inexact restoration for derivative-free expensive function minimization and applications.
J. Comput. Appl. Math., 2022
Comput. Optim. Appl., 2022
Accelerated derivative-free nonlinear least-squares applied to the estimation of Manning coefficients.
Comput. Optim. Appl., 2022
2021
A Shape Optimization Approach to the Problem of Covering a Two-Dimensional Region with Minimum-Radius Identical Balls.
SIAM J. Sci. Comput., 2021
Eur. J. Oper. Res., 2021
Accelerated derivative-free spectral residual method for nonlinear systems of equations.
CoRR, 2021
2020
Optim. Methods Softw., 2020
On the use of third-order models with fourth-order regularization for unconstrained optimization.
Optim. Lett., 2020
Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact.
Math. Comput., 2020
Models for the two-dimensional rectangular single large placement problem with guillotine cuts and constrained pattern.
Int. Trans. Oper. Res., 2020
The multiperiod two-dimensional non-guillotine cutting stock problem with usable leftovers.
Int. Trans. Oper. Res., 2020
Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem.
Comput. Oper. Res., 2020
A filtered beam search method for the <i>m</i>-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs.
Comput. Oper. Res., 2020
Preface of the special issue dedicated to the XII Brazilian workshop on continuous optimization.
Comput. Optim. Appl., 2020
An Augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem.
Comput. Appl. Math., 2020
2019
A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids.
Eur. J. Oper. Res., 2019
A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization.
Comput. Optim. Appl., 2019
2018
On Regularization and Active-set Methods with Complexity for Constrained Optimization.
SIAM J. Optim., 2018
On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors.
Math. Comput., 2018
Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points.
Comput. Optim. Appl., 2018
2017
The Use of Quadratic Regularization with a Cubic Descent Condition for Unconstrained Optimization.
SIAM J. Optim., 2017
On the minimization of possibly discontinuous functions by means of pointwise approximations.
Optim. Lett., 2017
Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models.
Math. Program., 2017
J. Glob. Optim., 2017
2016
Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models.
SIAM J. Optim., 2016
Int. Trans. Oper. Res., 2016
EURO J. Comput. Optim., 2016
Comput. Optim. Appl., 2016
2015
J. Comput. Appl. Math., 2015
Expert Syst. Appl., 2015
List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility.
Eur. J. Oper. Res., 2015
Comput. Optim. Appl., 2015
2014
Optim. Lett., 2014
MIP models for two-dimensional non-guillotine cutting problems with usable leftovers.
J. Oper. Res. Soc., 2014
Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming.
J. Glob. Optim., 2014
Fundamentals of algorithms 10, SIAM, ISBN: 978-1-611-97335-8, 2014
2013
Optim. Lett., 2013
Deterministic and stochastic global optimization techniques for planar covering with ellipses problems.
Eur. J. Oper. Res., 2013
2012
The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems.
Optim. Methods Softw., 2012
Generating unconstrained two-dimensional non-guillotine cutting patterns by a Recursive Partitioning Algorithm.
J. Oper. Res. Soc., 2012
Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization.
Comput. Optim. Appl., 2012
2011
J. Glob. Optim., 2011
2010
Partial spectral projected gradient method with active-set strategy for linearly constrained optimization.
Numer. Algorithms, 2010
Global minimization using an Augmented Lagrangian method with variable lower-level constraints.
Math. Program., 2010
An effective recursive partitioning approach for the packing of identical rectangles in a rectangle.
J. Oper. Res. Soc., 2010
Continuous GRASP with a local active-set method for bound-constrained global optimization.
J. Glob. Optim., 2010
New and improved results for packing identical unitary radius circles within triangles, rectangles and strips.
Comput. Oper. Res., 2010
Second-order negative-curvature methods for box-constrained and general constrained optimization.
Comput. Optim. Appl., 2010
Comput. Ind. Eng., 2010
2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
PACKMOL: A package for building initial configurations for molecular dynamics simulations.
J. Comput. Chem., 2009
2008
Optim. Methods Softw., 2008
Augmented Lagrangian methods under the constant positive linear dependence constraint qualification.
Math. Program., 2008
Comput. Oper. Res., 2008
Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization.
Comput. Optim. Appl., 2008
2007
SIAM J. Optim., 2007
2006
J. Oper. Res. Soc., 2006
Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization.
Comput. Oper. Res., 2006
2005
A note on an <i>L</i>-approach for solving the manufacturer's pallet loading problem.
J. Oper. Res. Soc., 2005
Optimizing the packing of cylinders into a rectangular container: A nonlinear approach.
Eur. J. Oper. Res., 2005
Comput. Optim. Appl., 2005
2003
Numer. Algorithms, 2003
Solution of Bounded Nonlinear Systems of Equations Using Homotopies with Inexact Restoration.
Int. J. Comput. Math., 2003
Eur. J. Oper. Res., 2003
2002
Large-Scale Active-Set Box-Constrained Optimization Method with Spectral Projected Gradients.
Comput. Optim. Appl., 2002
2001
ACM Trans. Math. Softw., 2001
2000