1 |
Ausiello, G., P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccame-La, and M. Protasi, Complexity and approximation (Combinatorial optimization problems and their approximability properties), Springer, Berlin, 1999.
|
2 |
Chung, Y., "Inverse bin-packing number problems: Hardness and approximation results," Management Science and Financial Engineering 18, 2 (2012), 1-4.
DOI
ScienceOn
|
3 |
Chung, Y., J. F. Culus, and M. Demange, "Inverse booking problems," In Proceedings of the 2nd Work-shop on Algorithms and Computation, WALCOM Lecture Notes in Computer Science, 4921 (2008), 180-187.
|
4 |
Chung, Y., S. Hong, and M. Park, "Inverse interval scheduling problems," Manuscript 2013.
|
5 |
Garey, M. R. and D. S. Johnson, Computers and Intractability-A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
|
6 |
Harvey, W., "Computing two-dimensional integer hulls," SIAM Journal on Computing 28, 6 (1999), 2285-2299.
DOI
|
7 |
Heuberger, C., "Inverse combinatorial optimization: A survey on problems, methods, and Results," Journal of Combinatorial Optimization 8, 3 (2004), 329-361.
DOI
|
8 |
McCormick, S. T., S. R. Smallwood, and F. C. R. Spieksma, "A polynomial algorithm for multiprocessor scheduling with two job lengths," Mathematics of Operations Research 26, 1 (2001), 31-49.
DOI
ScienceOn
|