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 | Ganzzahlige Optimierung | Theorie | Theory | Konflikt | Conflict | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Zuordnungsproblem |
-
Upper and lower bounding procedures for the multiple knapsack assignment problem
Kataoka, Seiji, (2014)
-
Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty
Silva, Marco, (2020)
-
A new two-stage heuristic for the recreational vehicle scheduling problem
Kulkarni, Sarang, (2018)
- More ...
-
Akyüz, M. Hakan, (2012)
-
Beam search heuristics for the single and multi-commodity capacitated Multi-facility Weber Problems
Akyüz, M. Hakan, (2013)
-
Akyüz, M. Hakan, (2014)
- More ...