0 Item

Qualitative Topics in Integer Linear Programming

By: V.N. Shevchenko

Write A Review

Hardcover | 1 January 1996

At a Glance

Hardcover
160 Pages

Hardcover

$454.25

or 4 interest-free payments of $113.56 with

Aims to ship in 15 to 25 business days

When will this arrive by?
Enter delivery postcode to estimate

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 analysed 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.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.