Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Nonlinear Discrete Optimization: An Algorithmic Theory
 
Shmuel Onn Israel Institute of Technology, Haifa, Israel
A publication of European Mathematical Society
Nonlinear Discrete Optimization
Softcover ISBN:  978-3-03719-093-7
Product Code:  EMSZLEC/13
List Price: $42.00
AMS Member Price: $33.60
Please note AMS points can not be used for this product
Nonlinear Discrete Optimization
Click above image for expanded view
Nonlinear Discrete Optimization: An Algorithmic Theory
Shmuel Onn Israel Institute of Technology, Haifa, Israel
A publication of European Mathematical Society
Softcover ISBN:  978-3-03719-093-7
Product Code:  EMSZLEC/13
List Price: $42.00
AMS Member Price: $33.60
Please note AMS points can not be used for this product
  • Book Details
     
     
    EMS Zurich Lectures in Advanced Mathematics
    Volume: 132010; 147 pp
    MSC: Primary 05; 11; 13; 14; 15;

    This monograph develops an algorithmic theory of nonlinear discrete optimization. It introduces a simple and useful setup, which enables the polynomial time solution of broad fundamental classes of nonlinear combinatorial optimization and integer programming problems in variable dimension. An important part of this theory is enhanced by recent developments in the algebra of Graver bases. The power of the theory is demonstrated by deriving the first polynomial time algorithms in a variety of application areas within operations research and statistics, including vector partitioning, matroid optimization, experimental design, multicommodity flows, multi-index transportation and privacy in statistical databases.

    This monograph is intended for graduate students and researchers. It is accessible to anyone with standard undergraduate knowledge and mathematical maturity.

    A publication of the European Mathematical Society (EMS). Distributed within the Americas by the American Mathematical Society.

    Readership

    Graduate students and research mathematicians interested in nonlinear discrete optimization.

  • Requests
     
     
    Review Copy – for publishers of book reviews
    Accessibility – to request an alternate format of an AMS title
Volume: 132010; 147 pp
MSC: Primary 05; 11; 13; 14; 15;

This monograph develops an algorithmic theory of nonlinear discrete optimization. It introduces a simple and useful setup, which enables the polynomial time solution of broad fundamental classes of nonlinear combinatorial optimization and integer programming problems in variable dimension. An important part of this theory is enhanced by recent developments in the algebra of Graver bases. The power of the theory is demonstrated by deriving the first polynomial time algorithms in a variety of application areas within operations research and statistics, including vector partitioning, matroid optimization, experimental design, multicommodity flows, multi-index transportation and privacy in statistical databases.

This monograph is intended for graduate students and researchers. It is accessible to anyone with standard undergraduate knowledge and mathematical maturity.

A publication of the European Mathematical Society (EMS). Distributed within the Americas by the American Mathematical Society.

Readership

Graduate students and research mathematicians interested in nonlinear discrete optimization.

Review Copy – for publishers of book reviews
Accessibility – to request an alternate format of an AMS title
Please select which format for which you are requesting permissions.