AMS Bookstore LOGO amslogo
Return to List  Item: 1 of 1   
Qualitative Topics in Integer Linear Programming
V. N. Shevchenko, Nizhnii Novgorod, Russia

Translations of Mathematical Monographs
1997; 146 pp; hardcover
Volume: 156
ISBN-10: 0-8218-0535-5
ISBN-13: 978-0-8218-0535-0
List Price: US$82
Member Price: US$65.60
Order Code: MMONO/156
[Add Item]

Integer solutions for systems of linear inequalities, equations, and congruences are considered along with the construction and theoretical analysis of integer programming algorithms. The complexity of algorithms is analyzed dependent upon two parameters: the dimension, and the maximal modulus of the coefficients describing the conditions of the problem. The analysis is based on a thorough treatment of the qualitative and quantitative aspects of integer programming, in particular on bounds obtained by the author for the number of extreme points. This permits progress in many cases in which the traditional approach--which regards complexity as a function only of the length of the input--leads to a negative result.


Graduate students studying cybernetics and information science and applied mathematicians interested in the theory and applications of discrete optimization.


"Of interest ... references many papers in Russian that are largely unavailable outside (and, sometimes, inside) Russia."

-- Mathematical Reviews

Table of Contents

  • Intersection of a convex polyhedral cone with the integer lattice
  • A discrete analogue of the Farkas theorem, and the problem of aggregation of a system of linear integer equations
  • Intersection of a convex polyhedral set with the integer lattice
  • Cut methods in integer programming
  • Complexity questions in integer linear programming
  • Appendices
  • Bibliography
Powered by MathJax
Return to List  Item: 1 of 1   

  AMS Home | Comments:
© Copyright 2014, American Mathematical Society
Privacy Statement

AMS Social

AMS and Social Media LinkedIn Facebook Podcasts Twitter YouTube RSS Feeds Blogs Wikipedia