000			01863cam a2200349 i 4500
001			18262
005			20260123162748.0
008			980413r19981982nyua b 001 0 eng
010			_a98021476
020			_a0486402584 _qpbk.
040			_aDLC _beng _cDLC _dCIT _dUtOrBLW _dBAUN _erda
041	0		_aeng
049			_aBAUN_MERKEZ
050	0	4	_aQA402.5 _b.P37 1999
082	0	0	_221
100	1		_aPapadimitriou, Christos H _992664 _eaut
245	1	0	_aCombinatorial optimization : _balgorithms and complexity / _cChristos H. Papadimitriou, Kenneth Steiglitz
264		1	_aMineola, N.Y. : _bDover Publications, _c1999
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	0	_tOptimization problems _t--Simplex algorithm _t--Duality _t--Computational considerations for the simplex algorithm _t--Primal-dual algorithm _t--Primal-dual algorithms for max-flow and shortest path: ford-fulkerson and dijkstra _t--Primal-dual algorithms for min-cost flow _t--Algorithms and complexity _t--Efficient algorithms for the max-flow problem _t--Algorithms for matching _t--Weighted matching _t--Spanning trees and matroids _t--Integer linear programming _t--A cutting-plane algorithm for integer linear programs _t--NP-complete problems _t--More about NP-completeness _t--Approximation algorithms _t--Branch-and-bound and dynamic programming _t--Local search
650		0	_aMathematical optimization _926499
650		0	_aCombinatorial optimization _976726
650		0	_aComputational complexity _979158
700	1		_aSteiglitz, Kenneth, _d1939- _996465 _eaut
900			_bSatın
942			_2lcc _cKT
999			_c15675 _d15675