default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIgnacio Araya 0001
Person information
- affiliation: Pontifical Catholic University of Valparaíso, Chile
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j22]Ignacio Araya
, Martín Toledo:
A fill-and-reduce greedy algorithm for the container pre-marshalling problem. Oper. Res. 23(3): 51 (2023)- 2022
- [j21]Ignacio Araya, Victor Beas, Katrina Stamulis, Héctor Allende-Cid:
Predicting student performance in computing courses based on programming behavior. Comput. Appl. Eng. Educ. 30(4): 1264-1276 (2022) - [j20]Francisco Casas, Claudio E. Torres, Ignacio Araya:
A heuristic search based on diversity for solving combinatorial problems. J. Heuristics 28(3): 287-328 (2022) - 2021
- [j19]Leslie Pérez Cáceres, Ignacio Araya, Guillermo Cabrera-Guerrero:
Stochastic Local Search for the Direct Aperture Optimisation Problem. Expert Syst. Appl. 182: 115206 (2021) - [j18]Víctor Reyes, Ignacio Araya:
AbsTaylor: upper bounding with inner regions in nonlinear continuous global optimization problems. J. Glob. Optim. 79(2): 413-429 (2021) - [j17]Ignacio Araya, Damir Aliquintui, Franco Ardiles, Braulio Lobo:
Nonlinear biobjective optimization: improving the upper envelope using feasible line segments. J. Glob. Optim. 79(2): 503-520 (2021) - [j16]Víctor Reyes, Ignacio Araya:
A GRASP-based scheme for the set covering problem. Oper. Res. 21(4): 2391-2408 (2021) - 2020
- [j15]Ignacio Araya, Mauricio Moyano, Cristobal Sanchez:
A beam search algorithm for the biobjective container loading problem. Eur. J. Oper. Res. 286(2): 417-431 (2020)
2010 – 2019
- 2019
- [j14]Ignacio Araya, Víctor Reyes:
Enhancing interval constraint propagation by identifying and filtering n-ary subsystems. J. Glob. Optim. 74(1): 1-20 (2019) - [j13]Ignacio Araya, Jose Campusano, Damir Aliquintui:
Nonlinear biobjective optimization: improvements to interval branch & bound algorithms. J. Glob. Optim. 75(1): 91-110 (2019) - [c17]Leslie Pérez Cáceres, Ignacio Araya, Denisse Soto, Guillermo Cabrera-Guerrero:
Stochastic Local Search Algorithms for the Direct Aperture Optimisation Problem in IMRT. HM 2019: 108-123 - 2018
- [j12]Ignacio Araya, Bertrand Neveu:
lsmear: a variable selection strategy for interval branch and bound solvers. J. Glob. Optim. 71(3): 483-500 (2018) - 2017
- [j11]Ignacio Araya, Keitel Guerrero, Eduardo Nuñez:
VCS: A new heuristic function for selecting boxes in the single container loading problem. Comput. Oper. Res. 82: 27-35 (2017) - 2016
- [j10]Bertrand Neveu, Gilles Trombettoni, Ignacio Araya:
Node selection strategies in interval Branch and Bound algorithms. J. Glob. Optim. 64(2): 289-304 (2016) - [j9]Ignacio Araya, Víctor Reyes:
Interval Branch-and-Bound algorithms for optimization and constraint satisfaction: a survey and prospects. J. Glob. Optim. 65(4): 837-866 (2016) - [c16]Víctor Reyes, Ignacio Araya, Broderick Crawford, Ricardo Soto, Eduardo Olguín:
A Beam-Search Approach to the Set Covering Problem. CSOC (1) 2016: 395-402 - [c15]Ricardo Soto, Broderick Crawford, César Carrasco, Boris Almonacid, Víctor Reyes, Ignacio Araya, Sanjay Misra, Eduardo Olguín:
Solving Manufacturing Cell Design Problems by Using a Dolphin Echolocation Algorithm. ICCSA (5) 2016: 77-86 - [c14]Ricardo Soto, Broderick Crawford, Nicolas Fernandez, Víctor Reyes, Stefanie Niklander, Ignacio Araya:
Solving Manufacturing Cell Design Problems Using the Black Hole Algorithm. MICAI (1) 2016: 391-398 - [c13]Ricardo Soto, Broderick Crawford, Andrés Alarcón, Carolina Zec, Emanuel Vega, Víctor Reyes, Ignacio Araya, Eduardo Olguín:
Solving Manufacturing Cell Design Problems by Using a Bat Algorithm Approach. ICSI (1) 2016: 184-191 - 2015
- [j8]Bertrand Neveu, Gilles Trombettoni, Ignacio Araya:
Adaptive constructive interval disjunction: algorithms and experiments. Constraints An Int. J. 20(4): 452-467 (2015) - [j7]Ignacio Araya, Ricardo Soto, Broderick Crawford:
Adaptive filtering strategy for numerical constraint satisfaction problems. Expert Syst. Appl. 42(21): 8086-8094 (2015) - 2014
- [j6]Ignacio Araya, María Cristina Riff:
A beam search approach to the container loading problem. Comput. Oper. Res. 43: 100-107 (2014) - [j5]Ignacio Araya, Gilles Trombettoni, Bertrand Neveu, Gilles Chabert:
Upper bounding in inner regions for global optimization under inequality constraints. J. Glob. Optim. 60(2): 145-164 (2014) - [j4]Ignacio Araya, María Cristina Riff:
A filtering method for algorithm configuration based on consistency techniques. Knowl. Based Syst. 60: 73-81 (2014) - [c12]Víctor Reyes, Ignacio Araya:
Probing-Based Variable Selection Heuristics for NCSPs. ICTAI 2014: 16-23 - [c11]Ignacio Araya:
Estimating Upper Bounds for Improving the Filtering in Interval Branch and Bound Optimizers. ICTAI 2014: 24-30 - 2013
- [c10]Juan Pablo Cares, María Cristina Riff Rojas, Ignacio Araya:
LS2R: A local search algorithm to solve scheduling radiotherapy problems. HIS 2013: 256-261 - [c9]Ignacio Araya, Víctor Reyes, Cristian Oreallana:
More Smear-Based Variable Selection Heuristics for NCSPs. ICTAI 2013: 1004-1011 - 2012
- [j3]Ignacio Araya, Bertrand Neveu, Gilles Trombettoni:
An interval extension based on occurrence grouping. Computing 94(2-4): 173-188 (2012) - [j2]Leopoldo Altamirano Robles, María Cristina Riff, Ignacio Araya, Lorraine Trilling:
Anesthesiology Nurse Scheduling using Particle Swarm Optimization. Int. J. Comput. Intell. Syst. 5(1): 111-125 (2012) - [c8]Ignacio Araya, Gilles Trombettoni, Bertrand Neveu:
A Contractor Based on Convex Interval Taylor. CPAIOR 2012: 1-16 - [c7]Ignacio Araya, Leslie Pérez Cáceres, María Cristina Riff:
Towards a population-based framework for improving stochastic local search algorithms. GECCO 2012: 337-344 - 2011
- [c6]Gilles Trombettoni, Ignacio Araya, Bertrand Neveu, Gilles Chabert:
Inner Regions and Interval Linearizations for Global Optimization. AAAI 2011: 99-104 - 2010
- [c5]Ignacio Araya, Gilles Trombettoni, Bertrand Neveu:
Exploiting Monotonicity in Interval Constraint Propagation. AAAI 2010: 9-14 - [c4]Ignacio Araya, Gilles Trombettoni, Bertrand Neveu:
Making Adaptive an Interval Constraint Propagation Algorithm Exploiting Monotonicity. CP 2010: 61-68
2000 – 2009
- 2009
- [c3]Ignacio Araya, Gilles Trombettoni, Bertrand Neveu:
Filtering Numerical CSPs Using Well-Constrained Subsystems. CP 2009: 158-172 - 2008
- [j1]Bertrand Neveu, Gilles Trombettoni, Ignacio Araya, María Cristina Riff:
A Strip Packing Solving Method Using an Incremental Move Based on Maximal Holes. Int. J. Artif. Intell. Tools 17(5): 881-901 (2008) - [c2]Ignacio Araya, Bertrand Neveu, Gilles Trombettoni:
Exploiting Common Subexpressions in Numerical CSPs. CP 2008: 342-357 - [p1]Ignacio Araya, Bertrand Neveu, María Cristina Riff:
An Efficient Hyperheuristic for Strip-Packing Problems. Adaptive and Multilevel Metaheuristics 2008: 61-76 - 2007
- [c1]Bertrand Neveu, Gilles Trombettoni, Ignacio Araya:
Incremental Move for 2D Strip-Packing. ICTAI (2) 2007: 489-496
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
