@inproceedings{conf/micai/Gomez-HerreraRO17,
  added-at = {2019-01-02T00:00:00.000+0100},
  author = {Gómez-Herrera, Fernando and Ramirez-Valenzuela, Rodolfo A. and Ortiz-Bayliss, José Carlos and Amaya, Iván and Terashima-Marín, Hugo},
  biburl = {https://www.bibsonomy.org/bibtex/2d8f6972a5303588da34a2fcaa6ec42fb/dblp},
  booktitle = {MICAI (1)},
  crossref = {conf/micai/2017-1},
  editor = {Castro, Félix and Miranda-Jiménez, Sabino and González-Mendoza, Miguel},
  ee = {https://doi.org/10.1007/978-3-030-02837-4_10},
  interhash = {749b6a3fd063bf64bbfb434a2e57b93f},
  intrahash = {d8f6972a5303588da34a2fcaa6ec42fb},
  isbn = {978-3-030-02837-4},
  keywords = {dblp},
  pages = {118-128},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2019-05-15T17:36:36.000+0200},
  title = {A Quartile-Based Hyper-heuristic for Solving the 0/1 Knapsack Problem.},
  url = {http://dblp.uni-trier.de/db/conf/micai/micai2017-1.html#Gomez-HerreraRO17},
  volume = 10632,
  year = 2017
}

{"_id":"ikM2Bkhk8YGpCJsTt","bibbaseid":"gmezherrera-ramirezvalenzuela-ortizbayliss-amaya-terashimamarn-aquartilebasedhyperheuristicforsolvingthe01knapsackproblem-2017","authorIDs":[],"author_short":["Gómez-Herrera, F.","Ramirez-Valenzuela, R. A.","Ortiz-Bayliss, J. C.","Amaya, I.","Terashima-Marín, H."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","added-at":"2019-01-02T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["Gómez-Herrera"],"firstnames":["Fernando"],"suffixes":[]},{"propositions":[],"lastnames":["Ramirez-Valenzuela"],"firstnames":["Rodolfo","A."],"suffixes":[]},{"propositions":[],"lastnames":["Ortiz-Bayliss"],"firstnames":["José","Carlos"],"suffixes":[]},{"propositions":[],"lastnames":["Amaya"],"firstnames":["Iván"],"suffixes":[]},{"propositions":[],"lastnames":["Terashima-Marín"],"firstnames":["Hugo"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/2d8f6972a5303588da34a2fcaa6ec42fb/dblp","booktitle":"MICAI (1)","crossref":"conf/micai/2017-1","editor":[{"propositions":[],"lastnames":["Castro"],"firstnames":["Félix"],"suffixes":[]},{"propositions":[],"lastnames":["Miranda-Jiménez"],"firstnames":["Sabino"],"suffixes":[]},{"propositions":[],"lastnames":["González-Mendoza"],"firstnames":["Miguel"],"suffixes":[]}],"ee":"https://doi.org/10.1007/978-3-030-02837-4_10","interhash":"749b6a3fd063bf64bbfb434a2e57b93f","intrahash":"d8f6972a5303588da34a2fcaa6ec42fb","isbn":"978-3-030-02837-4","keywords":"dblp","pages":"118-128","publisher":"Springer","series":"Lecture Notes in Computer Science","timestamp":"2019-05-15T17:36:36.000+0200","title":"A Quartile-Based Hyper-heuristic for Solving the 0/1 Knapsack Problem.","url":"http://dblp.uni-trier.de/db/conf/micai/micai2017-1.html#Gomez-HerreraRO17","volume":"10632","year":"2017","bibtex":"@inproceedings{conf/micai/Gomez-HerreraRO17,\n added-at = {2019-01-02T00:00:00.000+0100},\n author = {Gómez-Herrera, Fernando and Ramirez-Valenzuela, Rodolfo A. and Ortiz-Bayliss, José Carlos and Amaya, Iván and Terashima-Marín, Hugo},\n biburl = {https://www.bibsonomy.org/bibtex/2d8f6972a5303588da34a2fcaa6ec42fb/dblp},\n booktitle = {MICAI (1)},\n crossref = {conf/micai/2017-1},\n editor = {Castro, Félix and Miranda-Jiménez, Sabino and González-Mendoza, Miguel},\n ee = {https://doi.org/10.1007/978-3-030-02837-4_10},\n interhash = {749b6a3fd063bf64bbfb434a2e57b93f},\n intrahash = {d8f6972a5303588da34a2fcaa6ec42fb},\n isbn = {978-3-030-02837-4},\n keywords = {dblp},\n pages = {118-128},\n publisher = {Springer},\n series = {Lecture Notes in Computer Science},\n timestamp = {2019-05-15T17:36:36.000+0200},\n title = {A Quartile-Based Hyper-heuristic for Solving the 0/1 Knapsack Problem.},\n url = {http://dblp.uni-trier.de/db/conf/micai/micai2017-1.html#Gomez-HerreraRO17},\n volume = 10632,\n year = 2017\n}\n\n","author_short":["Gómez-Herrera, F.","Ramirez-Valenzuela, R. A.","Ortiz-Bayliss, J. C.","Amaya, I.","Terashima-Marín, H."],"editor_short":["Castro, F.","Miranda-Jiménez, S.","González-Mendoza, M."],"key":"conf/micai/Gomez-HerreraRO17","id":"conf/micai/Gomez-HerreraRO17","bibbaseid":"gmezherrera-ramirezvalenzuela-ortizbayliss-amaya-terashimamarn-aquartilebasedhyperheuristicforsolvingthe01knapsackproblem-2017","role":"author","urls":{"Link":"https://doi.org/10.1007/978-3-030-02837-4_10","Paper":"http://dblp.uni-trier.de/db/conf/micai/micai2017-1.html#Gomez-HerreraRO17"},"keyword":["dblp"],"downloads":0},"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/author/valenzuela?items=1000","creationDate":"2020-08-18T15:31:02.221Z","downloads":0,"keywords":["dblp"],"search_terms":["quartile","based","hyper","heuristic","solving","knapsack","problem","gómez-herrera","ramirez-valenzuela","ortiz-bayliss","amaya","terashima-marín"],"title":"A Quartile-Based Hyper-heuristic for Solving the 0/1 Knapsack Problem.","year":2017,"dataSources":["nBeLTcg3g4P8FeZpE"]}