Ignacio Araya

According to our database, Ignacio Araya authored at least 40 papers between 2007 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2023

A fill-and-reduce greedy algorithm for the container pre-marshalling problem.

Ignacio Araya, Martín Toledo

Oper. Res., September, 2023

2022

A heuristic search based on diversity for solving combinatorial problems.

Francisco Casas, Claudio E. Torres, Ignacio Araya

J. Heuristics, 2022

Predicting student performance in computing courses based on programming behavior.

Ignacio Araya, Victor Beas, Katrina Stamulis, Héctor Allende-Cid

Comput. Appl. Eng. Educ., 2022

2021

A GRASP-based scheme for the set covering problem.

Víctor Reyes, Ignacio Araya

Oper. Res., 2021

AbsTaylor: upper bounding with inner regions in nonlinear continuous global optimization problems.

Víctor Reyes, Ignacio Araya

J. Glob. Optim., 2021

Nonlinear biobjective optimization: improving the upper envelope using feasible line segments.

Ignacio Araya, Damir Aliquintui, Franco Ardiles, Braulio Lobo

J. Glob. Optim., 2021

Stochastic Local Search for the Direct Aperture Optimisation Problem.

Leslie Pérez Cáceres, Ignacio Araya, Guillermo Cabrera-Guerrero

Expert Syst. Appl., 2021

2020

A beam search algorithm for the biobjective container loading problem.

Ignacio Araya, Mauricio Moyano, Cristobal Sanchez

Eur. J. Oper. Res., 2020

2019

Enhancing interval constraint propagation by identifying and filtering n-ary subsystems.

Ignacio Araya, Víctor Reyes

J. Glob. Optim., 2019

Nonlinear biobjective optimization: improvements to interval branch & bound algorithms.

Ignacio Araya, Jose Campusano, Damir Aliquintui

J. Glob. Optim., 2019

Stochastic Local Search Algorithms for the Direct Aperture Optimisation Problem in IMRT.

Leslie Pérez Cáceres, Ignacio Araya, Denisse Soto, Guillermo Cabrera-Guerrero

Proceedings of the Hybrid Metaheuristics - 11th International Workshop, 2019

2018

lsmear: a variable selection strategy for interval branch and bound solvers.

Ignacio Araya, Bertrand Neveu

J. Glob. Optim., 2018

2017

VCS: A new heuristic function for selecting boxes in the single container loading problem.

Ignacio Araya, Keitel Guerrero, Eduardo Nuñez

Comput. Oper. Res., 2017

2016

Node selection strategies in interval Branch and Bound algorithms.

Bertrand Neveu, Gilles Trombettoni, Ignacio Araya

J. Glob. Optim., 2016

Interval Branch-and-Bound algorithms for optimization and constraint satisfaction: a survey and prospects.

Ignacio Araya, Víctor Reyes

J. Glob. Optim., 2016

Solving Manufacturing Cell Design Problems by Using a Bat Algorithm Approach.

Ricardo Soto, Broderick Crawford, Andrés Alarcón, Carolina Zec, Emanuel Vega, Víctor Reyes, Ignacio Araya, Eduardo Olguín

Proceedings of the Advances in Swarm Intelligence, 7th International Conference, 2016

Solving Manufacturing Cell Design Problems Using the Black Hole Algorithm.

Ricardo Soto, Broderick Crawford, Nicolas Fernandez, Víctor Reyes, Stefanie Niklander, Ignacio Araya

Proceedings of the Advances in Computational Intelligence, 2016

Solving Manufacturing Cell Design Problems by Using a Dolphin Echolocation Algorithm.

Ricardo Soto, Broderick Crawford, César Carrasco, Boris Almonacid, Víctor Reyes, Ignacio Araya, Sanjay Misra, Eduardo Olguín

Proceedings of the Computational Science and Its Applications - ICCSA 2016, 2016

A Beam-Search Approach to the Set Covering Problem.

Víctor Reyes, Ignacio Araya, Broderick Crawford, Ricardo Soto, Eduardo Olguín

Proceedings of the Artificial Intelligence Perspectives in Intelligent Systems, 2016

2015

Adaptive filtering strategy for numerical constraint satisfaction problems.

Ignacio Araya, Ricardo Soto, Broderick Crawford

Expert Syst. Appl., 2015

Adaptive constructive interval disjunction: algorithms and experiments.

Bertrand Neveu, Gilles Trombettoni, Ignacio Araya

Constraints An Int. J., 2015

2014

A filtering method for algorithm configuration based on consistency techniques.

Ignacio Araya, María Cristina Riff

Knowl. Based Syst., 2014

Upper bounding in inner regions for global optimization under inequality constraints.

Ignacio Araya, Gilles Trombettoni, Bertrand Neveu, Gilles Chabert

J. Glob. Optim., 2014

A beam search approach to the container loading problem.

Ignacio Araya, María Cristina Riff

Comput. Oper. Res., 2014

Probing-Based Variable Selection Heuristics for NCSPs.

Víctor Reyes, Ignacio Araya

Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

Estimating Upper Bounds for Improving the Filtering in Interval Branch and Bound Optimizers.

Ignacio Araya

Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

2013

More Smear-Based Variable Selection Heuristics for NCSPs.

Ignacio Araya, Víctor Reyes, Cristian Oreallana

Proceedings of the 25th IEEE International Conference on Tools with Artificial Intelligence, 2013

LS2R: A local search algorithm to solve scheduling radiotherapy problems.

Juan Pablo Cares, María Cristina Riff Rojas, Ignacio Araya

Proceedings of the 13th International Conference on Hybrid Intelligent Systems, 2013

2012

Anesthesiology Nurse Scheduling using Particle Swarm Optimization.

Leopoldo Altamirano Robles, María Cristina Riff, Ignacio Araya, Lorraine Trilling

Int. J. Comput. Intell. Syst., 2012

An interval extension based on occurrence grouping.

Ignacio Araya, Bertrand Neveu, Gilles Trombettoni

Computing, 2012

Towards a population-based framework for improving stochastic local search algorithms.

Ignacio Araya, Leslie Pérez Cáceres, María Cristina Riff

Proceedings of the Genetic and Evolutionary Computation Conference, 2012

A Contractor Based on Convex Interval Taylor.

Ignacio Araya, Gilles Trombettoni, Bertrand Neveu

Proceedings of the Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, 2012

2011

Inner Regions and Interval Linearizations for Global Optimization.

Gilles Trombettoni, Ignacio Araya, Bertrand Neveu, Gilles Chabert

Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010

Making Adaptive an Interval Constraint Propagation Algorithm Exploiting Monotonicity.

Ignacio Araya, Gilles Trombettoni, Bertrand Neveu

Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

Exploiting Monotonicity in Interval Constraint Propagation.

Ignacio Araya, Gilles Trombettoni, Bertrand Neveu

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009

Filtering Numerical CSPs Using Well-Constrained Subsystems.

Ignacio Araya, Gilles Trombettoni, Bertrand Neveu

Proceedings of the Principles and Practice of Constraint Programming, 2009

2008

An Efficient Hyperheuristic for Strip-Packing Problems.

Ignacio Araya, Bertrand Neveu, María Cristina Riff

Proceedings of the Adaptive and Multilevel Metaheuristics, 2008

A Strip Packing Solving Method Using an Incremental Move Based on Maximal Holes.

Bertrand Neveu, Gilles Trombettoni, Ignacio Araya, María Cristina Riff

Int. J. Artif. Intell. Tools, 2008

Exploiting Common Subexpressions in Numerical CSPs.

Ignacio Araya, Bertrand Neveu, Gilles Trombettoni

Proceedings of the Principles and Practice of Constraint Programming, 2008

2007

Incremental Move for 2D Strip-Packing.

Bertrand Neveu, Gilles Trombettoni, Ignacio Araya

Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007), 2007