Bøger af V.N. Shevchenko

Considers integer solutions for systems of linear inequalities, equations, and congruences along with the construction and theoretical analysis of integer programming algorithms. This book analyzes the complexity of algorithms dependent upon two parameters: the dimension, and the maximal modulus of the coefficients.