To access the full text documents, please follow this link: http://hdl.handle.net/2117/114023
dc.contributor | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
---|---|
dc.contributor | Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals |
dc.contributor.author | Lizárraga Olivas, Evelia |
dc.contributor.author | Blesa Aguilera, Maria Josep |
dc.contributor.author | Blum, Christian |
dc.date | 2017 |
dc.identifier.citation | Lizárraga, E., Blesa, M., Blum, C. Construct, merge, solve and adapt versus large neighborhood search for solving the multi-dimensional Knapsack problem: Which one works better when?. A: European Conference on Evolutionary Computation in Combinatorial Optimization. "Evolutionary Computation in Combinatorial Optimization: 17th European Conference, EvoCOP 2017: Amsterdam, The Netherlands, April 19-21, 2017: proceedings". Amsterdam: Springer, 2017, p. 60-74. |
dc.identifier.citation | 978-3-319-55453-2 |
dc.identifier.citation | 10.1007/978-3-319-55453-2_5 |
dc.identifier.uri | http://hdl.handle.net/2117/114023 |
dc.language.iso | eng |
dc.publisher | Springer |
dc.relation | https://link.springer.com/chapter/10.1007%2F978-3-319-55453-2_5 |
dc.relation | info:eu-repo/grantAgreement/AGAUR/V PRI 2010-2013/2014 SGR 1034 |
dc.relation | info:eu-repo/grantAgreement/ES/TIN2012-37930-C02-02 |
dc.rights | info:eu-repo/semantics/openAccess |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat |
dc.subject | Algorithms |
dc.subject | Knapsack problems |
dc.subject | Search problems |
dc.subject | CMSA |
dc.subject | LNS |
dc.subject | Algorismes |
dc.title | Construct, merge, solve and adapt versus large neighborhood search for solving the multi-dimensional Knapsack problem: Which one works better when? |
dc.type | info:eu-repo/semantics/submittedVersion |
dc.type | info:eu-repo/semantics/conferenceObject |
dc.description.abstract | |
dc.description.abstract |