Construct, merge, solve and adapt versus large neighborhood search for solving the multi-dimensional knapsack problem: Which one works better when?

  1. Lizárraga, E.
  2. Blesa, M.J.
  3. Blum, C.
Liburu bilduma:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ISSN: 1611-3349,  0302-9743

ISBN: 9783319554525

Argitalpen urtea: 2017

Evolutionary Computation in Combinatorial Optimization -17th European Conference, EvoCOP 2017, Proceedings

Alea: 10197 LNCS

Orrialdeak: 60-74

Mota: Biltzar ekarpena

DOI: 10.1007/978-3-319-55453-2_5 GOOGLE SCHOLAR

Garapen Iraunkorreko Helburuak

Datuen iturria: Scopus