The three-dimensional matching problem in Kalmanson matrices
Year of publication: |
2013
|
---|---|
Authors: | Polyakovskiy, Sergey ; Spieksma, Frits C. R. ; Woeginger, Gerhard J. |
Published in: |
Journal of combinatorial optimization. - Norwell, Mass. : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 1339574-9. - Vol. 26.2013, 1, p. 1-9
|
Subject: | computational complexity | combinatorial optimization | tractable case | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Matching |
-
Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
Kasperski, Adam, (2013)
-
An alternative approach for proving the NP-hardness of optimization problems
Cheng, T. C. E., (2016)
-
On the complexity of the FIFO stack-up problem
Gurski, Frank, (2016)
- More ...
-
The approximability of three-dimensional assignment problems with bottleneck objective
Goossens, Dries, (2010)
-
Between a rock and a hard place : the two-to-one assignment problem
Goossens, Dries, (2012)
-
Between a rock and a hard place: the two-to-one assignment problem
Goossens, Dries, (2012)
- More ...