02406nam 22004575a 450 991015193160332120100820234500.03-03719-593-210.4171/093(CKB)3710000000953859(CH-001817-3)119-100820(PPN)178155810(EXLCZ)99371000000095385920100820j20100907 fy 0engurnn|mmmmamaatxtrdacontentcrdamediacrrdacarrierNonlinear Discrete Optimization[electronic resource] An Algorithmic Theory /Shmuel OnnZuerich, Switzerland European Mathematical Society Publishing House20101 online resource (147 pages)Zurich Lectures in Advanced Mathematics (ZLAM)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. The monograph is intended for graduate students and researchers. It is accessible to anyone with standard undergraduate knowledge and mathematical maturity.Linear programmingbicsscOperations research, mathematical programmingmscCombinatoricsmscLinear and multilinear algebra; matrix theorymscComputer sciencemscLinear programmingOperations research, mathematical programmingCombinatoricsLinear and multilinear algebra; matrix theoryComputer science90-xx05-xx15-xx68-xxmscOnn Shmuel1070606ch0018173BOOK9910151931603321Nonlinear Discrete Optimization2564453UNINA