1. I. S. Belov and Ya. N. Stolin, “An Algorithm for the One-Machine Calendar Planning Problem,” in Mathematical Economics and Functional Analysis (Nauka, Moscow, 1974), pp. 248–259 [in Russian].
2. M. I. Kadetz, “On a Property of the Vector Broken Lines in n-Dimensional Space,” Math. Sciences Progress, Ser. 1, 8, pp. 139–143 (1953).
3. S. V. Sevastyanov, “Geometry in Schedule Theory,” in Optimization Models and Methods (Nauka, Novosibirsk, 1988), pp. 226–261 (Rep. Akad. Nauk SSSR, Sib. Otdel., Inst. Mat., Novosibirsk, Vol. 10) [in Russian].
4. A. Dvoretsky, “Some Near-Sphericity Results,” in Proceedings of Symposium in Pure Mathematics, Vol. 7: Convexity (Amer. Math. Soc., Providence, RI, 1963), pp. 203–210.
5. A. Schryver, Combinatorial Optimization: Polyhedra and Efficiency (Springer, Berlin, 2003).