A primal-dual approximation algorithm for the asymmetric prize-collecting TSP
Year of publication: |
2013
|
---|---|
Authors: | Nguyen, Viet Hung |
Published in: |
Journal of combinatorial optimization. - Norwell, Mass. : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 1339574-9. - Vol. 25.2013, 2, p. 265-278
|
Subject: | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Rundreiseproblem | Travelling salesman problem |
-
Tool path optimisation method for large thin-wall part of spacecraft
Wang, Haichao, (2018)
-
Transgenetic algorithm for the travelling purchaser problem
Goldbarg, M. C., (2009)
-
A heuristic algorithm for the traveling salesman location problem on networks
Simchi-Levi, David, (1988)
- More ...
-
Kőnig’s edge-colouring theorem for all graphs
Cornaz, D., (2013)
-
Livelihood choices and welfare of farmland-lost households : a case study in Hanoi's peri-urban area
Nguyen Van Cong, (2019)
-
On the star forest polytope for trees and cycles
Aider, Meziane, (2019)
- More ...