000			01943cam a22003257a 4500
999			_c8155 _d8155
001			17599465
003			NG-AbAUS
005			20230319005618.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	0	0	_aQA402.5 _b.O56 2010
100	1		_aOnn, Shmuel. _9358
245	1	0	_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. _9322
650		0	_aNonlinear theories. _9359
830		0	_aZurich lectures in advanced mathematics. _9360
906			_a7 _bcbc _ccopycat _d2 _encip _f20 _gy-gencatlg
942			_2lcc _cBK _hQA402.5.O56 2010 _kQA402.5 _m.O56 2010
955			_bxh58 2013-01-23 z-processor _ixh58 2013-01-23 ; to Dewey