<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462025000100311</article-id>
<article-id pub-id-type="doi">10.13053/cys-29-1-5508</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Machine Learning, Missing Values, and Algorithm Selectors: The Untold Story]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Gárate-Escamilla]]></surname>
<given-names><![CDATA[Anna Karen]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Ortiz-Bayliss]]></surname>
<given-names><![CDATA[José Carlos]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Terashima-Marín]]></surname>
<given-names><![CDATA[Hugo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Instituto Tecnológico y de Estudios Superiores de Monterrey School of Engineering and Science ]]></institution>
<addr-line><![CDATA[Monterrey ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>03</month>
<year>2025</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>03</month>
<year>2025</year>
</pub-date>
<volume>29</volume>
<numero>1</numero>
<fpage>311</fpage>
<lpage>323</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462025000100311&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462025000100311&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462025000100311&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: This paper presents a study of the potential benefits of incorporating missing values into the training process of algorithm selectors powered by machine learning algorithms, particularly those used for classification. This work analyzes various scenarios related to omitting some of the data available for training and measures the performance of the algorithm selectors produced to estimate how resistant they are to the presence of missing values within the training data. Our experiments open a new and exciting perspective on training algorithm selectors, one where it is possible to save computational resources by omitting some calculations, reducing the effort to produce such selectors, but without significantly harming their performance on unseen instances. For example, our results show that given a proper training set and deciding which runs to omit completely at random, some Machine Learning strategies such as Neural Networks, Naďve Bayes Classifiers, and Support Vector Machines can correctly operate as algorithm selectors with up to 50% of the data missing (data about the solvers to choose from), without any further treatment of the missing values.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Algorithm selection]]></kwd>
<kwd lng="en"><![CDATA[bin packing problem]]></kwd>
<kwd lng="en"><![CDATA[machine learning]]></kwd>
<kwd lng="en"><![CDATA[missing values]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Alissa]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Sim]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Hart]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Automated algorithm selection: From feature-based to feature-free approaches]]></article-title>
<source><![CDATA[Journal of Heuristics]]></source>
<year>2023</year>
<volume>29</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1&#8212;-38</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cervantes]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Garcia-Lamont]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Rodríguez-Mazahua]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Lopez]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A comprehensive survey on support vector machine classification: Applications, challenges and trends]]></article-title>
<source><![CDATA[Neurocomputing]]></source>
<year>2020</year>
<volume>408</volume>
<page-range>189-215</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chalé]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Bastian]]></surname>
<given-names><![CDATA[N. D.]]></given-names>
</name>
<name>
<surname><![CDATA[Weir]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Algorithm selection framework for cyber attack detection]]></source>
<year>2020</year>
<conf-name><![CDATA[ 2nd ACM Workshop on Wireless Security and Machine Learning]]></conf-name>
<conf-loc>New York, NY, USA </conf-loc>
<page-range>37-42</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Ding]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Qin]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A two-stage genetic programming framework for stochastic resource constrained multi-project scheduling problem under new project insertions]]></article-title>
<source><![CDATA[Applied Soft Computing]]></source>
<year>2022</year>
<volume>124</volume>
<page-range>109087</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Guestrin]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Xgboost: A scalable tree boosting system]]></source>
<year>2016</year>
<conf-name><![CDATA[ 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining]]></conf-name>
<conf-loc>New York, NY, USA </conf-loc>
<page-range>785-94</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cohen]]></surname>
<given-names><![CDATA[W. W.]]></given-names>
</name>
<name>
<surname><![CDATA[Singer]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
</person-group>
<source><![CDATA[A simple, fast, and effective rule learner]]></source>
<year>1999</year>
<conf-name><![CDATA[ Sixteenth National Conference on Artificial Intelligence and the Eleventh Innovative Applications of Artificial Intelligence Conference Innovative Applications of Artificial Intelligence]]></conf-name>
<conf-loc>USA </conf-loc>
<page-range>335-42</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Díaz de León-Hicks]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Conant-Pablos]]></surname>
<given-names><![CDATA[S. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Ortiz-Bayliss]]></surname>
<given-names><![CDATA[J. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Terashima-Marín]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Addressing the algorithm selection problem through an attention-based meta-learner approach]]></article-title>
<source><![CDATA[Applied Sciences]]></source>
<year>2023</year>
<volume>13</volume>
<numero>7</numero>
<issue>7</issue>
</nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Eliiyi]]></surname>
<given-names><![CDATA[U.]]></given-names>
</name>
<name>
<surname><![CDATA[Eliiyi]]></surname>
<given-names><![CDATA[D. T.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Applications of bin packing models through the supply chain]]></article-title>
<source><![CDATA[International journal of business and management]]></source>
<year>2009</year>
<volume>1</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>11-9</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gomes]]></surname>
<given-names><![CDATA[C. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Selman]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Algorithm portfolios]]></article-title>
<source><![CDATA[Artificial Intelligence]]></source>
<year>2001</year>
<volume>126</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>43-62</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Guo]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Hsu]]></surname>
<given-names><![CDATA[W. H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A machine learning approach to algorithm selection for NP\mathcal{NP} -hard optimization problems: a case study on the MPE problem]]></article-title>
<source><![CDATA[Ann. Oper. Res.]]></source>
<year>2007</year>
<volume>156</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>61-82</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Heymans]]></surname>
<given-names><![CDATA[M. W.]]></given-names>
</name>
<name>
<surname><![CDATA[Twisk]]></surname>
<given-names><![CDATA[J. W.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Handling missing data in clinical research]]></article-title>
<source><![CDATA[Journal of Clinical Epidemiology]]></source>
<year>2022</year>
<volume>151</volume>
<page-range>185-8</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Korte]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Vygen]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Bin-Packing]]></source>
<year>2018</year>
<page-range>489-507</page-range><publisher-loc><![CDATA[Berlin, Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer Berlin Heidelberg]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[LeCun]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Bengio]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Hinton]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Deep learning]]></article-title>
<source><![CDATA[nature]]></source>
<year>2015</year>
<volume>521</volume>
<numero>7553</numero>
<issue>7553</issue>
<page-range>436</page-range></nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Burke]]></surname>
<given-names><![CDATA[E. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Qu]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Integrating neural networks and logistic re-gression to underpin hyper-heuristic search]]></article-title>
<source><![CDATA[Knowledge-Based Systems]]></source>
<year>2011</year>
<volume>24</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>322-30</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Özcan]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Drake]]></surname>
<given-names><![CDATA[J. H.]]></given-names>
</name>
<name>
<surname><![CDATA[Maashi]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A generality analysis of multiobjective hyper-heuristics]]></article-title>
<source><![CDATA[Information Sciences]]></source>
<year>2023</year>
<volume>627</volume>
<page-range>34-51</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Lamichhane]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Lu]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The adaptive algorithm for the selection of sources of the method of fundamental solutions]]></article-title>
<source><![CDATA[Engineering Analysis with Boundary Elements]]></source>
<year>2018</year>
<volume>95</volume>
<page-range>154-9</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Marcel Panzer]]></surname>
<given-names><![CDATA[B. B.]]></given-names>
</name>
<name>
<surname><![CDATA[Gronau]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A deep reinforcement learning based hyper-heuristic for modular production control]]></article-title>
<source><![CDATA[International Journal of Production Research]]></source>
<year>2023</year>
<volume>0</volume>
<numero>0</numero>
<issue>0</issue>
<page-range>1-22</page-range></nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Melder]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Drake]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An evolutionary hyper-heuristic for airport slot allocation]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Correia]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Smith]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Qaddoura]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Applications of Evolutionary Computation]]></source>
<year>2023</year>
<page-range>53-68</page-range><publisher-loc><![CDATA[Cham ]]></publisher-loc>
<publisher-name><![CDATA[Springer Nature Switzerland]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Muńoz]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Soleimani]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Kandanaarachchi]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Benchmarking algorithm portfolio construction methods]]></source>
<year>2022</year>
<conf-name><![CDATA[ Genetic and Evolutionary Computation Conference Companion]]></conf-name>
<conf-loc>New York, NY, USA </conf-loc>
<page-range>499&#8212;-502</page-range></nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Munien]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Ezugwu]]></surname>
<given-names><![CDATA[A. E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Meta-heuristic algorithms for one-dimensional bin-packing problems: A survey of recent advances and applications]]></article-title>
<source><![CDATA[Journal of Intelligent Systems]]></source>
<year>2021</year>
<volume>30</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>636-63</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Olivas]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Amaya]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[carlos Ortiz-Bayliss]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Conant-Pablos]]></surname>
<given-names><![CDATA[S. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Terashima-Marín]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Enhancing hyperheuristics for the knapsack problem through fuzzy logic]]></article-title>
<source><![CDATA[Computational Intelligence and Neuroscience]]></source>
<year>2021</year>
<volume>2021</volume>
</nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ortiz-Bayliss]]></surname>
<given-names><![CDATA[J. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Amaya]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Cruz-Duarte]]></surname>
<given-names><![CDATA[J. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Gutierrez-Rodriguez]]></surname>
<given-names><![CDATA[A. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Conant-Pablos]]></surname>
<given-names><![CDATA[S. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Terashima-Marín]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A general framework based on machine learning for algorithm selection in constraint satisfaction problems]]></article-title>
<source><![CDATA[Applied Sciences]]></source>
<year>2021</year>
<volume>11</volume>
<numero>6</numero>
<issue>6</issue>
</nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ortiz-Bayliss]]></surname>
<given-names><![CDATA[J. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Gárate-Escamilla]]></surname>
<given-names><![CDATA[A. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Terashima-Marín]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Missing data and their effect on algorithm selection for the bin packing problem]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Mezura-Montes]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Acosta-Mesa]]></surname>
<given-names><![CDATA[H. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Carrasco-Ochoa]]></surname>
<given-names><![CDATA[J. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Martínez-Trinidad]]></surname>
<given-names><![CDATA[J. F.]]></given-names>
</name>
<name>
<surname><![CDATA[Olvera-López]]></surname>
<given-names><![CDATA[J. A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Pattern Recognition]]></source>
<year>2024</year>
<page-range>34-43</page-range><publisher-loc><![CDATA[Cham ]]></publisher-loc>
<publisher-name><![CDATA[Springer Nature Switzerland]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ortiz-Bayliss]]></surname>
<given-names><![CDATA[J. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Terashima-Marín]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Conant-Pablos]]></surname>
<given-names><![CDATA[S. E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Learning vector quantization for variable ordering in constraint satisfaction problems]]></article-title>
<source><![CDATA[Pattern Recognition Letters]]></source>
<year>2013</year>
<volume>34</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>423-32</page-range></nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Piechowiak]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Drozdowski]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Éric Sanlaville]]></surname>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Framework of algorithm portfolios for strip packing problem]]></article-title>
<source><![CDATA[Computers &amp; Industrial Engineering]]></source>
<year>2022</year>
<volume>172</volume>
<page-range>108538</page-range></nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pillay]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Qu]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Selection Constructive Hyper-Heuristics]]></source>
<year>2018</year>
<page-range>7-16</page-range><publisher-loc><![CDATA[Cham ]]></publisher-loc>
<publisher-name><![CDATA[Springer International Publishing]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B27">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Plata-González]]></surname>
<given-names><![CDATA[L. F.]]></given-names>
</name>
<name>
<surname><![CDATA[Amaya]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Ortiz-Bayliss]]></surname>
<given-names><![CDATA[J. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Conant-Pablos]]></surname>
<given-names><![CDATA[S. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Terashima-Marín]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Coello]]></surname>
<given-names><![CDATA[C. A. C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Evolutionary-based tailoring of synthetic instances for the knapsack problem]]></article-title>
<source><![CDATA[Soft Comput.]]></source>
<year>2019</year>
<volume>23</volume>
<numero>23</numero>
<issue>23</issue>
<page-range>12711-28</page-range></nlm-citation>
</ref>
<ref id="B28">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pylyavskyy]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Kheiri]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Ahmed]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<source><![CDATA[A reinforcement learning hyper-heuristic for the optimisation of flight connections]]></source>
<year>2020</year>
<conf-name><![CDATA[ Congress on Evolutionary Computation (CEC)]]></conf-name>
<conf-date>2020</conf-date>
<conf-loc> </conf-loc>
<page-range>1-8</page-range></nlm-citation>
</ref>
<ref id="B29">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rauchwerger]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Yu]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An adaptive algorithm selection framework for reduction parallelization]]></article-title>
<source><![CDATA[IEEE Transactions on Parallel and Distributed Systems]]></source>
<year>2006</year>
<volume>17</volume>
<numero>10</numero>
<issue>10</issue>
<page-range>1084-96</page-range></nlm-citation>
</ref>
<ref id="B30">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ren]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Sekhari Seklouli]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Bouras]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A review on missing values for main challenges and methods]]></article-title>
<source><![CDATA[Information Systems]]></source>
<year>2023</year>
<volume>119</volume>
<page-range>102268</page-range></nlm-citation>
</ref>
<ref id="B31">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rice]]></surname>
<given-names><![CDATA[J. R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The algorithm selection problem]]></article-title>
<source><![CDATA[Advances in Computers]]></source>
<year>1976</year>
<volume>15</volume>
<page-range>65-118</page-range><publisher-name><![CDATA[Elsevier]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B32">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rodríguez-Esparza]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Masegosa]]></surname>
<given-names><![CDATA[A. D.]]></given-names>
</name>
<name>
<surname><![CDATA[Oliva]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Onieva]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new hyper-heuristic based on adaptive simulated annealing and reinforcement learning for the capacitated electric vehicle routing problem]]></article-title>
<source><![CDATA[Expert Systems with Applications]]></source>
<year>2024</year>
<volume>252</volume>
<page-range>124197</page-range></nlm-citation>
</ref>
<ref id="B33">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Salama]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Kaihara]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Fujii]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Kokuryo]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Dispatching rules selection mechanism using support vector machine for genetic programming in job shop scheduling]]></article-title>
<source><![CDATA[IFAC-PapersOnLine]]></source>
<year>2023</year>
<volume>56</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>7814-9</page-range></nlm-citation>
</ref>
<ref id="B34">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Shang]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Ma]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Sun]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The sorted-waste capacitated location routing problem with queuing time: A cross-entropy and simulated-annealing-based hyper-heuristic algorithm]]></article-title>
<source><![CDATA[Expert Systems with Applications]]></source>
<year>2022</year>
<volume>201</volume>
<page-range>117077</page-range></nlm-citation>
</ref>
<ref id="B35">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Slavchev]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Masliankova]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Kelk]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A machine learning approach to algorithm selection for exact computation of treewidth]]></article-title>
<source><![CDATA[Algorithms]]></source>
<year>2019</year>
<volume>12</volume>
<numero>10</numero>
<issue>10</issue>
</nlm-citation>
</ref>
<ref id="B36">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Taunk]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[De]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Verma]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Swetapadma]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[A brief review of nearest neighbor algorithm for learning and classification]]></source>
<year>2019</year>
<conf-name><![CDATA[ International Conference on Intelligent Computing and Control Systems (ICCS)]]></conf-name>
<conf-date>2019</conf-date>
<conf-loc> </conf-loc>
<page-range>1255-60</page-range></nlm-citation>
</ref>
<ref id="B37">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tong]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Cai]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Cai]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A novel intelligent hyper-heuristic algorithm for solving optimization problems]]></article-title>
<source><![CDATA[J. Intell. Fuzzy Syst.]]></source>
<year>2022</year>
<volume>42</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>5041-53</page-range></nlm-citation>
</ref>
<ref id="B38">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tornede]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Gehring]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Tornede]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Wever]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Hüllermeier]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Algorithm selection on a meta level]]></article-title>
<source><![CDATA[Mach. Learn.]]></source>
<year>2022</year>
<volume>112</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>1253-86</page-range></nlm-citation>
</ref>
<ref id="B39">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tyasnurita]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Özcan]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[John]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Learning heuristic selection using a time delay neural network for open vehicle routing]]></source>
<year>2017</year>
<conf-name><![CDATA[ Congress on Evolutionary Computation (CEC)]]></conf-name>
<conf-date>2017</conf-date>
<conf-loc> </conf-loc>
<page-range>1474-81</page-range></nlm-citation>
</ref>
<ref id="B40">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Bai]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Qu]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Tu]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Jin]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties]]></article-title>
<source><![CDATA[Eur. J. Oper. Res.]]></source>
<year>2021</year>
<volume>300</volume>
<page-range>418-27</page-range></nlm-citation>
</ref>
<ref id="B41">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zolnierek]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Rubacha]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The empirical study of the naive bayes classifier in the case of markov chain recognition task]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Kurzy&#324;ski]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Pucha&#322;a]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Wo&#378;niak]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[&#380;o&#322;nierek]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computer Recognition Systems]]></source>
<year>2005</year>
<page-range>329-36</page-range><publisher-loc><![CDATA[Berlin, Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer Berlin Heidelberg]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
