A hybrid heuristic for the diameter constrained minimum spanning tree problem
Year of publication: |
2010
|
---|---|
Authors: | Lucena, Abilio ; Ribeiro, Celso C. ; Santos, Andréa C. |
Published in: |
Journal of global optimization : an international journal dealing with theoretical and computational aspects of seeking global optima and their applications in science, management and engineering. - Dordrecht [u.a.] : Springer, ISSN 0925-5001, ZDB-ID 1074566x. - Vol. 46.2010, 3, p. 363-382
|
Saved in:
Saved in favorites
Similar items by person
-
Solving diameter-constrained minimum spanning tree problems by constraint programming
Noronha, Thiago F., (2010)
-
Stronger K-tree relaxations for the vehicle routing problem
Martinhon, Carlos, (2004)
-
Time-dependent travelling salesman problem - The deliveryman case
LUCENA, Abilio, (1988)
- More ...