Publisher
Zhejiang University Press
Reference10 articles.
1. Babel, L., Kellerer, H., Kotov, V., 1998. The k-partitioning problem. Math. Methods Oper. Res., 47(1):59–82. [doi:10.1007/BF01193837]
2. Burkard, R.E., Yao, E.Y., 1990. Constrained partitioning problems. Discr. Appl. Math., 28(1):21–34. [doi:10.1016/0166-218X(90)90091-P]
3. Edmonds, J., 1965. Minimum partition of a matroid into independent subsets. J. Res. NBS, 69B:67–72.
4. Garey, M.R., Johnson, D.S., 1978. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco, CA.
5. Graham, R.L., 1969. Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math., 17(2):416–429. [doi:10.1137/0117039]