Incremental Move for 2D Strip-Packing. - Bertrand Neveu; Gilles Trombettoni; Ignacio Araya 001 (ICTAI (2), 2007)

Exploiting Common Subexpressions in Numerical CSPs. - Ignacio Araya 001; Bertrand Neveu; Gilles Trombettoni (CP, 2008)

A Strip Packing Solving Method Using an Incremental Move Based on Maximal Holes. - Bertrand Neveu; Gilles Trombettoni; Ignacio Araya 001; María Cristina Riff (Int. J. Artif. Intell. Tools, 2008)

An Efficient Hyperheuristic for Strip-Packing Problems. - Ignacio Araya 001; Bertrand Neveu; María Cristina Riff (Adaptive and Multilevel Metaheuristics, 2008)

Filtering Numerical CSPs Using Well-Constrained Subsystems. - Ignacio Araya 001; Gilles Trombettoni; Bertrand Neveu (CP, 2009)

Exploiting Monotonicity in Interval Constraint Propagation. - Ignacio Araya 001; Gilles Trombettoni; Bertrand Neveu (AAAI, 2010)

Making Adaptive an Interval Constraint Propagation Algorithm Exploiting Monotonicity. - Ignacio Araya 001; Gilles Trombettoni; Bertrand Neveu (CP, 2010)

Inner Regions and Interval Linearizations for Global Optimization. - Gilles Trombettoni; Ignacio Araya 001; Bertrand Neveu; Gilles Chabert (AAAI, 2011)

A Contractor Based on Convex Interval Taylor. - Ignacio Araya 001; Gilles Trombettoni; Bertrand Neveu (CPAIOR, 2012)

Towards a population-based framework for improving stochastic local search algorithms. - Ignacio Araya 001; Leslie Pérez Cáceres; María Cristina Riff (GECCO, 2012)

An interval extension based on occurrence grouping. - Ignacio Araya 001; Bertrand Neveu; Gilles Trombettoni (Computing, 2012)

Anesthesiology Nurse Scheduling using Particle Swarm Optimization. - Leopoldo Altamirano Robles; María Cristina Riff; Ignacio Araya 001; Lorraine Trilling (Int. J. Comput. Intell. Syst., 2012)

LS2R: A local search algorithm to solve scheduling radiotherapy problems. - Juan Pablo Cares; María Cristina Riff Rojas; Ignacio Araya 001 (HIS, 2013)

More Smear-Based Variable Selection Heuristics for NCSPs. - Ignacio Araya 001; Víctor Reyes; Cristian Oreallana (ICTAI, 2013)

Estimating Upper Bounds for Improving the Filtering in Interval Branch and Bound Optimizers. - Ignacio Araya 001 (ICTAI, 2014)

Probing-Based Variable Selection Heuristics for NCSPs. - Víctor Reyes; Ignacio Araya 001 (ICTAI, 2014)

A beam search approach to the container loading problem. - Ignacio Araya 001; María Cristina Riff (Comput. Oper. Res., 2014)

Upper bounding in inner regions for global optimization under inequality constraints. - Ignacio Araya 001; Gilles Trombettoni; Bertrand Neveu; Gilles Chabert (J. Glob. Optim., 2014)

A filtering method for algorithm configuration based on consistency techniques. - Ignacio Araya 001; María Cristina Riff (Knowl. Based Syst., 2014)

Adaptive constructive interval disjunction: algorithms and experiments. - Bertrand Neveu; Gilles Trombettoni; Ignacio Araya 001 (Constraints An Int. J., 2015)

Adaptive filtering strategy for numerical constraint satisfaction problems. - Ignacio Araya 001; Ricardo Soto 001; Broderick Crawford (Expert Syst. Appl., 2015)

A Beam-Search Approach to the Set Covering Problem. - Víctor Reyes; Ignacio Araya 001; Broderick Crawford; Ricardo Soto 001; Eduardo Olguín (CSOC (1), 2016)

Solving Manufacturing Cell Design Problems by Using a Dolphin Echolocation Algorithm. - Ricardo Soto 001; Broderick Crawford; César Carrasco; Boris Almonacid; Víctor Reyes; Ignacio Araya 001; Sanjay Misra; Eduardo Olguín (ICCSA (5), 2016)

Solving Manufacturing Cell Design Problems Using the Black Hole Algorithm. - Ricardo Soto 001; Broderick Crawford; Nicolas Fernandez; Víctor Reyes; Stefanie Niklander; Ignacio Araya 001 (MICAI (1), 2016)

Solving Manufacturing Cell Design Problems by Using a Bat Algorithm Approach. - Ricardo Soto 001; Broderick Crawford; Andrés Alarcón; Carolina Zec; Emanuel Vega; Víctor Reyes; Ignacio Araya 001; Eduardo Olguín (ICSI (1), 2016)

Interval Branch-and-Bound algorithms for optimization and constraint satisfaction: a survey and prospects. - Ignacio Araya 001; Víctor Reyes (J. Glob. Optim., 2016)

Node selection strategies in interval Branch and Bound algorithms. - Bertrand Neveu; Gilles Trombettoni; Ignacio Araya 001 (J. Glob. Optim., 2016)

VCS: A new heuristic function for selecting boxes in the single container loading problem. - Ignacio Araya 001; Keitel Guerrero; Eduardo Nuñez (Comput. Oper. Res., 2017)

lsmear: a variable selection strategy for interval branch and bound solvers. - Ignacio Araya 001; Bertrand Neveu (J. Glob. Optim., 2018)

Stochastic Local Search Algorithms for the Direct Aperture Optimisation Problem in IMRT. - Leslie Pérez Cáceres; Ignacio Araya 001; Denisse Soto; Guillermo Cabrera-Guerrero (HM, 2019)

Nonlinear biobjective optimization: improvements to interval branch & bound algorithms. - Ignacio Araya 001; Jose Campusano; Damir Aliquintui (J. Glob. Optim., 2019)

Enhancing interval constraint propagation by identifying and filtering n-ary subsystems. - Ignacio Araya 001; Víctor Reyes (J. Glob. Optim., 2019)

A beam search algorithm for the biobjective container loading problem. - Ignacio Araya 001; Mauricio Moyano; Cristobal Sanchez (Eur. J. Oper. Res., 2020)

Stochastic Local Search for the Direct Aperture Optimisation Problem. - Leslie Pérez Cáceres; Ignacio Araya 001; Guillermo Cabrera-Guerrero (Expert Syst. Appl., 2021)

Nonlinear biobjective optimization: improving the upper envelope using feasible line segments. - Ignacio Araya 001; Damir Aliquintui; Franco Ardiles; Braulio Lobo (J. Glob. Optim., 2021)

AbsTaylor: upper bounding with inner regions in nonlinear continuous global optimization problems. - Víctor Reyes; Ignacio Araya 001 (J. Glob. Optim., 2021)

A GRASP-based scheme for the set covering problem. - Víctor Reyes; Ignacio Araya 001 (Oper. Res., 2021)

Predicting student performance in computing courses based on programming behavior. - Ignacio Araya 001; Victor Beas; Katrina Stamulis; Héctor Allende-Cid (Comput. Appl. Eng. Educ., 2022)

A heuristic search based on diversity for solving combinatorial problems. - Francisco Casas; Claudio E. Torres; Ignacio Araya 001 (J. Heuristics, 2022)

A fill-and-reduce greedy algorithm for the container pre-marshalling problem. - Ignacio Araya 001; Martín Toledo (Oper. Res., 2023)

Uncertainty Estimation in Classification of Massive Stars Spectra using Conformal Predictions. - Raquel Pezoa; Luis Salinas; Claudio E. Torres; Felipe Ortiz; Michel Cure; Ignacio Araya 001 (SCCC, 2024)

Injecting Bias through Prompts: Analyzing the Influence of Language on LLMs. - Nicolas Torres; Catalina Ulloa; Ignacio Araya 001; Matias Ayala; Sebastián Jara (SCCC, 2024)

A multi-stage machine learning-based method to estimate wind parameters from Hα lines of massive stars. - Felipe Ortiz; Raquel Pezoa; Michel Cure; Ignacio Araya 001; Roberto O. J. Venero; Catalina Arcos; Pedro Escárate; Natalia Machuca; Alejandra Christen (Astron. Comput., 2025)

A revised monotonicity-based method for computing tight image enclosures of functions. - Ignacio Araya 001; Víctor Reyes (J. Glob. Optim., 2025)

Node selection through upper bounding local search methods in branch & bound solvers for NCOPs. - Víctor Reyes; Ignacio Araya 001 (J. Glob. Optim., 2025)

Hybridizing two linear relaxation techniques in interval-based solvers. - Ignacio Araya 001; Frédéric Messine; Jordan Ninin; Gilles Trombettoni (J. Glob. Optim., 2025)

Extending interval branch-and-bound from two to few objectives in nonlinear multiobjective optimization. - Ignacio Araya 001; Víctor Reyes; Javier Montero (J. Glob. Optim., 2025)