Qualitative Topics in Integer Linear Programming Book

	Notation
	Foreword
Ch. 1	Intersection of a Convex Polyhedral Cone with the Integer Lattice	1
Ch. 2	A Discrete Analogue of the Farkas Theorem, and the Problem of Aggregation of a System of Linear Integer Equations	25
Ch. 3	Intersection of a Convex Polyhedral Set with the Integer Lattice	35
Ch. 4	Cut Methods in Integer Programming	61
Ch. 5	Complexity Questions in Integer Linear Programming	79
Appendix 1	Solution of Systems of Linear Equations and Congruences in Integers	97
Appendix 2	Examples of Applied Problems Related to the Topic of the Book	101
Appendix 3	Investigation of Minor and Permanent Characteristics of Certain Boolean Matrices	109
Appendix 4	Threshold Functions of Many-Valued Logic and Their Deciphering	125
	Bibliography	133