000			02135nam a22003618i 4500
001			CR9780511616655
003			UkCbUP
005			20220711202544.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			090915s2004||||enk o ||1 0|eng|d
020			_a9780511616655 (ebook)
020			_z9780521811514 (hardback)
020			_z9780521010122 (paperback)
040			_aUkCbUP _beng _erda _cUkCbUP
050	0	0	_aQA402.5 _b.L394 2004
082	0	0	_a519.6/4 _222
100	1		_aLee, Jon, _d1960- _eauthor. _94589
245	1	2	_aA first course in combinatorial optimization / _cJon Lee.
264		1	_aCambridge : _bCambridge University Press, _c2004.
300			_a1 online resource (xvi, 211 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
490	1		_aCambridge texts in applied mathematics ; _v36
500			_aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
520			_aA First Course in Combinatorial Optimization is a 2004 text for a one-semester introductory graduate-level course for students of operations research, mathematics, and computer science. It is a self-contained treatment of the subject, requiring only some mathematical maturity. Topics include: linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Central to the exposition is the polyhedral viewpoint, which is the key principle underlying the successful integer-programming approach to combinatorial-optimization problems. Another key unifying topic is matroids. The author does not dwell on data structures and implementation details, preferring to focus on the key mathematical ideas that lead to useful models and algorithms. Problems and exercises are included throughout as well as references for further study.
650		0	_aCombinatorial optimization. _93389
776	0	8	_iPrint version: _z9780521811514
830		0	_aCambridge texts in applied mathematics ; _v36. _94590
856	4	0	_uhttps://doi.org/10.1017/CBO9780511616655
942			_cEBK
999			_c68298 _d68298