| Record ID | marc_loc_2016/BooksAll.2016.part40.utf8:95853753:1689 |
| Source | Library of Congress |
| Download Link | /show-records/marc_loc_2016/BooksAll.2016.part40.utf8:95853753:1689?format=raw |
LEADER: 01689cam a22002777a 4500
001 2012472766
003 DLC
005 20130124084620.0
008 130123s2010 sz a b 000 0 eng d
010 $a 2012472766
020 $a9783037190937 (pbk.)
020 $a3037190930 (pbk.)
035 $a(OCoLC)ocn692413513
040 $aNUI$cNUI$dRCE$dMUU$dCDX$dYDXCP$dVRC$dDLC
042 $alccopycat
050 00 $aQA402.5$b.O56 2010
100 1 $aOnn, Shmuel.
245 10 $aNonlinear discrete optimization :$ban algorithmic theory /$cShmuel Onn.
260 $aZürich, Switzerland :$bEuropean Mathematical Society Publishing House,$cc2010.
300 $ax, 137 :$bill. (some col.) ;$c24 cm.
490 1 $aZurich lectures in advanced mathematics
504 $aIncludes bibliographical references (p. [129]-134) and index.
520 $aThis 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. --Book Jacket.
650 0 $aMathematical optimization.
650 0 $aNonlinear theories.
830 0 $aZurich lectures in advanced mathematics.