Automatic design of algorithms for the traveling salesman problem
The automatic generation of procedures for combinatorial optimization problems is emerging as a new alternative to address the hardest problems of this class. One of these problems still offering great computational difficulty is the traveling salesman problem. Its simple presentation masks the grea...
Bewaard in:
| Hoofdauteurs: | , , , , |
|---|---|
| Formaat: | Artigo |
| Taal: | Inglês |
| Gepubliceerd in: |
Taylor & Francis Group
2016-12-01
|
| Reeks: | Cogent Engineering |
| Onderwerpen: | |
| Online toegang: | http://dx.doi.org/10.1080/23311916.2016.1255165 |
| Tags: |
Geen labels, Wees de eerste die dit record labelt!
|