A branch-and-bound algorithm for the acyclic partitioning problem
| Year of publication: |
2014
|
|---|---|
| Authors: | Nossack, Jenny ; Pesch, Erwin |
| 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. 41.2014, p. 174-184
|
| Subject: | Graph partitioning | Branch-and-bound | Constraint propagation | Acyclic graph | Container transshipment | Graphentheorie | Graph theory | Branch-and-Bound | Branch and Bound | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Ganzzahlige Optimierung | Integer programming |
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
-
Constraint-driven exact algorithm for the manufacturing cell formation problem
Merchichi, Sabrina, (2015)
-
A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts
Bianchessi, Nicola, (2021)
- More ...
-
Kress, Dominik, (2018)
-
Container dispatching and conflict-free yard crane routing in an automated container terminal
Nossack, Jenny, (2018)
-
The windy rural postman problem with a time-dependent zigzag option
Nossack, Jenny, (2017)
- More ...