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 | Scheduling-Verfahren | Scheduling problem | Ganzzahlige Optimierung | Integer programming |
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
-
Neto, Teresa, (2013)
-
The partitioning min-max weighted matching problem
Kress, Dominik, (2015)
- More ...
-
Minimizing setup costs in a transfer line design problem with sequential operation processing
Dolgui, Alexandre, (2014)
-
Mathematical formulations for a 1-full-truckload pickup-and-delivery problem
Gendreau, Michel, (2015)
-
A truck scheduling problem arising in intermodal container transportation
Nossack, Jenny, (2013)
- More ...