000			02957nam a22005175i 4500
001			978-1-4614-5286-7
003			DE-He213
005			20140220083250.0
007			cr nn 008mamaa
008			121026s2012 xxu| s |||| 0|eng d
020			_a9781461452867 _9978-1-4614-5286-7
024	7		_a10.1007/978-1-4614-5286-7 _2doi
050		4	_aQA166-166.247
072		7	_aPBV _2bicssc
072		7	_aMAT013000 _2bisacsh
082	0	4	_a511.5 _223
100	1		_aGoldengorin, Boris. _eauthor.
245	1	0	_aData Correcting Approaches in Combinatorial Optimization _h[electronic resource] / _cby Boris Goldengorin, Panos M. Pardalos.
264		1	_aNew York, NY : _bSpringer New York : _bImprint: Springer, _c2012.
300			_aX, 114 p. 41 illus. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aSpringerBriefs in Optimization, _x2190-8354
520			_aData Correcting Approaches in Combinatorial Optimization focuses on algorithmic applications of the well known polynomially solvable special cases of computationally intractable problems. The purpose of this text is to design practically efficient algorithms for solving wide classes of combinatorial optimization problems.  Researches, students and engineers will benefit from new bounds and branching rules in development efficient branch-and-bound type computational algorithms. This book examines applications for solving the Traveling Salesman Problem and its variations, Maximum Weight Independent Set Problem, Different Classes of Allocation and Cluster Analysis  as well as some classes of Scheduling Problems. Data Correcting Algorithms in Combinatorial Optimization  introduces the data correcting approach to algorithms which provide an answer to the following questions: how to construct a bound to the original intractable problem and find which element of the corrected instance  one should branch such that the total size of search tree will be minimized. The PC time needed for solving intractable problems will be adjusted with the requirements for solving real world problems.
650		0	_aMathematics.
650		0	_aData structures (Computer science).
650		0	_aComputer software.
650		0	_aAlgorithms.
650		0	_aMathematical optimization.
650	1	4	_aMathematics.
650	2	4	_aGraph Theory.
650	2	4	_aOptimization.
650	2	4	_aData Structures.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aAlgorithms.
700	1		_aPardalos, Panos M. _eauthor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9781461452850
830		0	_aSpringerBriefs in Optimization, _x2190-8354
856	4	0	_uhttp://dx.doi.org/10.1007/978-1-4614-5286-7
912			_aZDB-2-SMA
999			_c101526 _d101526