Ants can solve the team orienteering problem
Year of publication: |
2008
|
---|---|
Authors: | Ke, Liangjun ; Archetti, Claudia ; Feng, Zuren |
Published in: |
Computers & industrial engineering : CAIE ; an internat. journal. - Amsterdam [u.a.] : Elsevier, ISSN 0360-8352, ZDB-ID 1969936. - Vol. 54.2008, 3, p. 648-665
|
Saved in:
Saved in favorites
Similar items by person
-
Proportion-based robust optimization and team orienteering problem with interval data
Ke, Liangjun, (2013)
-
Proportion-based robust optimization and team orienteering problem with interval data
Ke, Liangjun, (2013)
-
Single machine scheduling with total tardiness criterion and convex controllable processing times
Xu, Kailiang, (2011)
- More ...