This is a preview of subscription content, log in via an institution to check access.
Literature Cited
L. G. Khachiyan, “A polynomial algorithm in linear programming,” Dokl. Akad. Nauk SSSR,244, No. 5, 1093–1096 (1979).
M. A. Frumkin, “An application of modular arithmetic to the construction of algorithms for solving systems of linear equations,” Dokl. Akad. Nauk SSSR,229, No. 5, 1067–1070 (1976).
N. N. Ivanov, Integral Points of Convex Polyhedral Sets, Author's Abstract of Doctoral Dissertation, Minsk (1976).
V. N. Shevchenko, “On the intersection of a convex polyhedral cone with an integral lattice,” Izv. Vyssh. Uchebn. Zaved., Radiofizika,13, No. 8, 1264–1266 (1970).
J. H. Grace and A. Young, The Algebra of Invariants, Chelsea, New York (1964).
R. P. Stanley, “Linear homogeneous diophantine equations and magic labelings of graphs,” Duke Math. J.,40, No. 3, 607–632 (1973).
R. T. Rockafellar, Convex Analysis, Princeton University Press, Princeton (1970).
V. N. Shevchenko and N. N. Ivanov, “The representation of a semigroup by a semigroup generated by a finite set of vectors,” Izv. Akad. Nauk BSSR, No. 2, 98–100 (1976).
V. N. Shevchenko, “Convex polyhedral cones, congruence systems, and regular cuts in integer programming,” in: Combinatorial-Algebraic Methods in Applied Mathematics [in Russian], Izd. Gor'kov. Gos. Univ., Gor'kii (1979), pp. 109–119.
S. N. Chernikov, Linear Inequalities [in Russian], Nauka, Moscow (1968).
A. P. Mishina and I. V. Proskuryakov, Higher Algebra, Pergamon Press, Oxford (1965).
V. N. Shevchenko, Linear Programming and the Theory of Linear Inequalities. Textbook [in Russian], Izd. Gor'kov. Gos. Univ., Gor'kii (1977).
S. Ginsburg, The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York (1966).
C. H. Papadimitriou, “On the complexity of integer programming,” J. Assoc. Comput. Mach.,28, No. 4, 765–768 (1981).
V. N. Shevchenko, “On the number of extreme points in integer programming,” Kibernetika, No. 2, 133–134 (1981).
R. R. Meyer and M. L. Wage, “On the polyhedrality of the convex hull of the feasible set on an integer program,” SIAM J. Control Optim.,16, No. 4, 682–687 (1978).
L. E. Dickson, “Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors,” Amer. J. Math.,35, 413–422 (1913).
B. L. van der Waerden, Modern Algebra, Vols. I and II, Ungar, New York (1949, 1950).
R. G. Jeroslow, “Cutting-plane theory: algebraic methods,” Discrete Math.,23, No. 2, 121–150 (1978).
R. G. Jeroslow, “Some basis theorems for integral monoids,” Math. Oper. Res.,3, No. 2, 145–154 (1978).
V. A. Emelichev, M. M. Kovalev, and M. K. Kravtsov, Polyhedra, Graphs, Optimization [in Russian], Nauka, Moscow (1981).
M. M. Kovalev, Discrete Optimization [in Russian], Izd. Belorussk. Gos. Univ., Minsk (1977).
E. G. Belousov, Introduction to Convex Analysis and Integer Programming [in Russian], Izd. Moskov. Gos. Univ., Moscow (1977).
M. R. Garey and D. S. Johnson, “Strong' NP-completeness results: motivation, examples, and implications,” J. Assoc. Comput. Mach.,25, No. 3, 499–508 (1978).
H. W. Lenstra, Jr., “Integer programming with a fixed number of variables,” Math. Oper. Res. (to appear).
G. Hadley, Nonlinear and Dynamic Programming, Addison-Wesley, Reading (1964).
Rights and permissions
About this article
Cite this article
Shevchenko, V.N., Shevchenko, V.N. Algebraic approach in integer programming. Cybern Syst Anal 20, 508–515 (1984). https://doi.org/10.1007/BF01068924
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068924