1. V. A. Emelichev, M. M. Kovalev, and M. K. Kravtsov, Polyhedra, Graphs, and Optimization (Nauka, Moscow, 1981) [in Russian].
2. R. Karp, “Reducibility among Combinatorial Problems,” In Complexity of Computer Computations (Plenum, New York, 1972), pp. 86–103.
3. R. Burkard, R. Rudolf, and G. Woeginger, “Three-Dimensional Axial Assignement Problems with Decomposable Cost-Coefficients,” Discrete Appl. Math. 65, 123–140 (1996).
4. C. Arbib, D. Pacciarelli, and S. A. Smriglio, “Three-Dimensional Matching Model for Perishable Production Scheduling,” Discrete Appl. Math. 92, 1–15 (1999).
5. Y. Grama, A. Oerlemans, and F. Spieksma, Production Planning in Automated Manufacturing (Springer, Berlin, 1996).