Assignment problem with conflicts
Year of publication: |
2019
|
---|---|
Authors: | Öncan, Temel ; Şuvak, Zeynep ; Akyüz, M. Hakan ; Altınel, İ. Kuban |
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. 111.2019, p. 214-229
|
Subject: | Assignment problem | Integer programming | Branch-and-bound | Conflicts | Theorie | Theory | Ganzzahlige Optimierung | Scheduling-Verfahren | Scheduling problem | Operations Research | Operations research | Mathematische Optimierung | Mathematical programming | Konflikt | Conflict | Zuordnungsproblem |
-
Neto, Teresa, (2013)
-
A new combinatorial branch-and-bound algorithm for the Knapsack problem with conflicts
Coniglio, Stefano, (2021)
-
Ein Workshopzuteilungsverfahren als zweistufige Auktion zur Enthüllung privater Präferenzen
Thede, Anke, (2007)
- More ...
-
Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem
Akyüz, M. Hakan, (2019)
-
Akyüz, M. Hakan, (2014)
-
Akyüz, M. Hakan, (2012)
- More ...