Free Delivery Over $100
|
|
|||
|
||||
OverviewInteger 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, lead to a negative result. Full Product DetailsAuthor: V.N. ShevchenkoPublisher: American Mathematical Society Imprint: American Mathematical Society Volume: No. 156 Weight: 0.510kg ISBN: 9780821805350ISBN 10: 0821805355 Pages: 160 Publication Date: 30 October 1996 Audience: College/higher education , Professional and scholarly , Undergraduate , Postgraduate, Research & Scholarly Format: Hardback Publisher's Status: Active Availability: In Print  This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |
||||
