"Building Hyper-heuristics Through Ant Colony Optimization for the 2D Bin ..."

Alberto Cuesta-Cañada, Leonardo Garrido, Hugo Terashima-Marín (2005)

> Home

Details and statistics

DOI: 10.1007/11554028_91

access: closed

type: Conference or Workshop Paper

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/kes/Cuesta-CanadaGT05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/kes/Cuesta-CanadaGT05
Alberto Cuesta-Cañada, Leonardo Garrido, Hugo Terashima-Marín:
Building Hyper-heuristics Through Ant Colony Optimization for the 2D Bin Packing Problem. KES (4) 2005: 654-660

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.