The partitioning min-max weighted matching problem
Year of publication: |
2015
|
---|---|
Authors: | Kress, Dominik ; Meiswinkel, Sebastian ; Pesch, Erwin |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 247.2015, 3 (16.12.), p. 745-754
|
Subject: | Assignment | Partitioning | Maximum matching | Bipartite graph | Container transshipment | Matching | Graphentheorie | Graph theory | Scheduling-Verfahren | Scheduling problem | Ganzzahlige Optimierung | Integer programming | Kooperatives Spiel | Cooperative game | Containerverkehr | Container transport |
-
Reformulated acyclic partitioning for rail-rail containers transshipment
Albareda-Sambola, Maria, (2019)
-
A branch-and-bound algorithm for the acyclic partitioning problem
Nossack, Jenny, (2014)
-
Design and analysis of multi-hospital kidney exchange mechanisms using random graphs
Toulis, Panos, (2015)
- More ...
-
A parallel machine schedule updating game with compensations and clients averse to uncertain loss
Kovalyov, Mikhail Y., (2019)
-
Mechanism design for machine scheduling problems : classification and literature overview
Kress, Dominik, (2018)
-
Kress, Dominik, (2018)
- More ...