Language: English
Published by American Mathematical Society, 1996
ISBN 10: 0821805355 ISBN 13: 9780821805350
Seller: Buchpark, Trebbin, Germany
Condition: Gut. Zustand: Gut | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.
Language: English
Published by American Mathematical Society, 1996
ISBN 10: 0821805355 ISBN 13: 9780821805350
Seller: Buchpark, Trebbin, Germany
Condition: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.
Language: English
Published by American Mathematical Society, 1996
ISBN 10: 0821805355 ISBN 13: 9780821805350
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Condition: New. 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. Series: Translations of Mathematical Monographs Reprint. Num Pages: 160 pages. BIC Classification: PBT; PBUH; PBW. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 230. Weight in Grams: 506. . 1996. Hardcover. . . . .
Language: English
Published by MP-AMM American Mathematical, 1996
ISBN 10: 0821805355 ISBN 13: 9780821805350
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.
Language: English
Published by American Mathematical Society, US, 1996
ISBN 10: 0821805355 ISBN 13: 9780821805350
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Hardback. Condition: New. 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.
Language: English
Published by American Mathematical Society, 1996
ISBN 10: 0821805355 ISBN 13: 9780821805350
Seller: Kennys Bookstore, Olney, MD, U.S.A.
Condition: New. 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. Series: Translations of Mathematical Monographs Reprint. Num Pages: 160 pages. BIC Classification: PBT; PBUH; PBW. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 230. Weight in Grams: 506. . 1996. Hardcover. . . . . Books ship from the US and Ireland.
Language: English
Published by American Mathematical Society, US, 1996
ISBN 10: 0821805355 ISBN 13: 9780821805350
Seller: Rarewaves.com UK, London, United Kingdom
Hardback. Condition: New. 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.