000			02048cam a2200409 i 4500
999			_c200438523 _d56735
001			200438523
003			TR-AnTOB
005			20231117150811.0
007			ta
008			980413r19981982nyua b 001 0 eng
010			_a98021476
020			_a0486402584 (pbk.)
020			_a9780486402581 (pbk.)
035			_a(TR-AnTOB)200438523
040			_aDLC _beng _erda _cDLC _dCIT _dUtOrBLW _dTR-AnTOB
041	0		_aeng
050	0	0	_aQA402.5 _b.P37 1998
090			_aQA402.5 _b.P37 1998
100	1		_aPapadimitriou, Christos H. _eauthor _94696
245	1	0	_aCombinatorial optimization : _balgorithms and complexity / _cChristos H. Papadimitriou, Kenneth Steiglitz
264		1	_aMineola, N.Y. : _bDover Publications, _c1998.
300			_axvi, 496 pages : _billustrations ; _c22 cm
336			_atext _btxt _2rdacontent
337			_aunmediated _bn _2rdamedia
338			_avolume _bnc _2rdacarrier
500			_aOriginally published: Englewood Cliffs, N.J. : Prentice Hall, c1982. With new pref
504			_aIncludes bibliographical references and index
505	0		_aOptimization problems -- Simplex algorithm -- Duality -- Computational considerations for the simplex algorithm -- Primal-dual algorithm -- Primal-dual algorithms for max-flow and shortest path: ford-fulkerson and dijkstra -- Primal-dual algorithms for min-cost flow -- Algorithms and complexity -- Efficient algorithms for the max-flow problem -- Algorithms for matching -- Weighted matching -- Spanning trees and matroids -- Integer linear programming -- A cutting-plane algorithm for integer linear programs -- NP-complete problems -- More about NP-completeness -- Approximation algorithms -- Branch-and-bound and dynamic programming -- Local search
590			_aDonated by Tuğçe Yücel
650		0	_aMathematical optimization _91131
650		0	_aCombinatorial optimization _9128249
650		0	_aComputational complexity _91359
700	1		_aSteiglitz, Kenneth, _d1939- _eauthor _9128250
942			_2lcc _cBK