This is a preview of subscription content, log in via an institution to check access.
References
V. S. Mikhalevich (ed.), Computational Methods for Choosing Optimal Design Solutions [in Russian], Naukova Dumka, Kiev (1977).
N. Z. Shor, Minimization Methods for Nondifferentiable Functions [in Russian], Naukova Dumka, Kiev (1979).
S. Even, A. Pnueli, and A. Lempel, "Permutation graphs and transitive graphs," J. ACM, No. 3, 400–410 (1972).
Yu. V. Voitishin, "Algorithms to solve the problem of the maximum set of pairwise incomparable weighted vertices in an acyclic directed graph," Kibernetika i Sistemnyi Analiz, No. 4, 5–11 (1991).
A. Kaufmann and A. Henri-Laborder, Methods and Models in Operations Research [Russian translation], Mir, Moscow (1977).
E. Balas and M. W. Padberg, "Set partitioning: a survey," SIAM Rev., No. 4, 710–760 (1976).
N. Z. Shor and S. I. Stetsenko, Quadratic Extremal Problems and Nondifferentiable Optimization [in Russian], Naukova Dumka, Kiev (1989).
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 71–76, November–December, 1993.
Rights and permissions
About this article
Cite this article
Shor, N.Z., Voitishin, Y.V. Dual network bounds for integer programming problems of a special form. Cybern Syst Anal 29, 842–846 (1993). https://doi.org/10.1007/BF01122737
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01122737