Lower tolerance-based Branch and Bound algorithms for the ATSP
Year of publication: |
2012
|
---|---|
Authors: | Germs, Remco ; Goldengorin, Boris ; Turkensteen, Marcel |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 39.2012, 2, p. 291-298
|
Subject: | Theorie | Theory | Branch-and-Bound | Branch and Bound | Mathematische Optimierung | Mathematical programming |
-
Ozturk, Onur, (2017)
-
Improved branching disjunctions for branch-and-bound : an analytic center approach
Elhedi, Samir, (2015)
-
An enhanced branch-and-bound algorithm for the talent scheduling problem
Qin, Hu, (2016)
- More ...
-
Iterative Patching and the Asymmetric Traveling Salesman Problem
Turkensteen, Marcel, (2004)
-
Tolerance-based Branch and Bound algorithms for the ATSP
Turkensteen, Marcel, (2008)
-
Tolerance-based Branch and Bound algorithms for the ATSP
Turkensteen, Marcel, (2008)
- More ...