A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem
Year of publication: |
2013
|
---|---|
Authors: | Christou, Ioannis T. ; Vassilaras, Spyridon |
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. 40.2013, 10, p. 2387-2397
|
Subject: | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound |
-
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 ...
-
A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem
Christou, Ioannis T., (2013)
-
A hierarchical system for effective coordination of available-to-promise logic mechanisms
Christou, Ioannis T., (2009)
-
Integrating Enterprise Resource Planning vendor evaluation into a proposed ERP selection methodology
Ponis, Stavros T., (2007)
- More ...