Scheduling meets n-fold integer programming
Year of publication: |
October 2018
|
---|---|
Authors: | Knop, Dušan ; Koutecký, Martin |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 21.2018, 5, p. 493-503
|
Subject: | Fixed parameterized tractability | Scheduling on parallel machines | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Ganzzahlige Optimierung | Integer programming |
-
Reentrant flow shop with identical jobs and makespan criterion
Shufan, Elad, (2023)
-
Adapted water wave optimization for integrated bank customer service representative scheduling
Lu, Xueqin, (2023)
-
A massively parallel exact solution algorithm for the balanced minimum evolution problem
Catanzaro, Daniele, (2023)
- More ...
-
Parameterized complexity of configuration integer programs
Knop, Dušan, (2021)
-
Approximating max-cut under graph-MSO constraints
Koutecký, Martin, (2018)
-
A note on the approximability of deepest-descent circuit steps
Borgwardt, Steffen Alexander, (2021)
- More ...