×







We sell 100% Genuine & New Books only!

Theory Of Linear Integer Programming at Meripustak

Theory Of Linear Integer Programming by Alexander Schrijver, John Wiley & Sons Inc

Books from same Author: Alexander Schrijver

Books from same Publisher: John Wiley & Sons Inc

Related Category: Author List / Publisher List


  • Price: ₹ 25362.00/- [ 7.00% off ]

    Seller Price: ₹ 23586.00

Estimated Delivery Time : 4-5 Business Days

Sold By: Meripustak      Click for Bulk Order

Free Shipping (for orders above ₹ 499) *T&C apply.

In Stock

We deliver across all postal codes in India

Orders Outside India


Add To Cart


Outside India Order Estimated Delivery Time
7-10 Business Days


  • We Deliver Across 100+ Countries

  • MeriPustak’s Books are 100% New & Original
  • General Information  
    Author(s)Alexander Schrijver
    PublisherJohn Wiley & Sons Inc
    EditionRevised ed.
    ISBN9780471982326
    Pages484
    BindingPaperback
    LanguageEnglish
    Publish YearJuly 1998

    Description

    John Wiley & Sons Inc Theory Of Linear Integer Programming by Alexander Schrijver

    Theory of Linear and Integer Programming Alexander Schrijver Centrum voor Wiskunde en Informatica Amsterdam The Netherlands This book describes the theory of linear and integer programming and surveys the algorithms for linear and integer programming problems focusing on complexity analysis. It aims at complementing the more practically oriented books in this field. A special feature is the authora s coverage of important recent developments in linear and integer programming. Applications to combinatorial optimization are given and the author also includes extensive historical surveys and bibliographies. The book is intended for graduate students and researchers in operations research mathematics and computer science. It will also be of interest to mathematical historians. Contents 1 Introduction and preliminaries; 2 Problems algorithms and complexity; 3 Linear algebra and complexity; 4 Theory of lattices and linear diophantine equations; 5 Algorithms for linear diophantine equations; 6 Diophantine approximation and basis reduction; 7 Fundamental concepts and results on polyhedra linear inequalities and linear programming; 8 The structure of polyhedra; 9 Polarity and blocking and antiblocking polyhedra; 10 Sizes and the theoretical complexity of linear inequalities and linear programming; 11 The simplex method; 12 Primaldual elimination and relaxation methods; 13 Khachiyana s method for linear programming; 14 The ellipsoid method for polyhedra more generally; 15 Further polynomiality results in linear programming; 16 Introduction to integer linear programming; 17 Estimates in integer linear programming; 18 The complexity of integer linear programming; 19 Totally unimodular matrices: fundamental properties and examples; 20 Recognizing total unimodularity; 21 Further theory related to total unimodularity; 22 Integral polyhedra and total dual integrality; 23 Cutting planes; 24 Further methods in integer linear programming; Historical and further notes on integer linear programming; References; Notation index; Author index; Subject index



    Book Successfully Added To Your Cart