Qualitative Topics in Integer Linear Programming (Hardcover)

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.

General

Imprint:	American Mathematical Society
Country of origin:	United States
Series:	Translations of Mathematical Monographs
Release date:	October 1996
Authors:	V.N. Shevchenko
Dimensions:	230mm (L)
Format:	Hardcover
Pages:	160
ISBN-13:	978-0-8218-0535-0
Categories:	Books > Science & Mathematics > Mathematics > Probability & statistics Books > Science & Mathematics > Mathematics > Optimization > Linear programming Books > Science & Mathematics > Mathematics > Applied mathematics > General
LSN:	0-8218-0535-5
Barcode:	9780821805350

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!