000			03838nam a2200349 i 4500
008			090630s2010 njua b 001 0 eng
010			_a2009025987
020			_a9780470373064 _qcloth
020			_a0470373067 _qcloth
035			_a(OCoLC)421948268
040			_aDLC _beng _cDLC _dC#P _dYDXCP _dBWX _dMUU _dOQ@ _dHEBIS _dBAUN _erda
049			_aBAUN_MERKEZ
050	0	4	_aT57.74 _b.C454 2010
082	0	0	_222
100	1		_aChen, Der-San, _d1940-
245	1	0	_aApplied integer programming : _bmodeling and solution / _cDer-San Chen, Robert G. Batson, Yu Dang
264		1	_aHoboken, N.J. : _bJohn Wiley and Sons, _c[2010]
264		4	_c©2010
300			_axix, 468 pages : _billustrations ; _c25 cm
336			_atext _btxt _2rdacontent
337			_aunmediated _bn _2rdamedia
338			_avolume _bnc _2rdacarrier
520			_a"In order to fully comprehend the algorithms associated with integer programming, it is important to understand not only how algorithms work, but also why they work. Applied Integer Programming features a unique emphasis on this point, focusing on problem modeling and solution using commercial software. Taking an application-oriented approach, this book addresses the art and science of mathematical modeling related to the mixed integer programming (MIP) framework and discusses the algorithms and associated practices that enable those models to be solved most efficiently. The book begins with coverage of successful applications, systematic modeling procedures, typical model types, transformation of non-MIP models, combinatorial optimization problem models, and automatic preprocessing to obtain a better formulation. Subsequent chapters present algebraic and geometric basic concepts of linear programming theory and network flows needed for understanding integer programming. Finally, the book concludes with classical and modern solution approaches as well as the key components for building an integrated software system capable of solving large-scale integer programming and combinatorial optimization problems. Throughout the book, the authors demonstrate essential concepts through numerous examples and figures. Each new concept or algorithm is accompanied by a numerical example, and, where applicable, graphics are used to draw together diverse problems or approaches into a unified whole. In addition, features of solution approaches found in today's commercial software are identified throughout the book. Thoroughly classroom-tested, Applied Integer Programming is an excellent book for integer programming courses at the upper-undergraduate and graduate levels. It also serves as a well-organized reference for professionals, software developers, and analysts who work in the fields of applied mathematics, computer science, operations research, management science, and engineering and use integer-programming techniques to model and solve real-world optimization problems."--Publisher's web site
505	0	0	_t-- Introduction _t-- Modeling and models _t-- Transformation using 0-1 variables _t-- Better formulation by preprocessing _t-- Modeling combinatorial optimization problems I _t-- Modeling combinatorial optimization problems II _t-- Linear programming : fundamentals _t-- Linear programming : geometric concepts _t-- Linear programming : solution methods _t-- Network optimization problems and solutions _t-- Classical solution approaches _t-- Branch-and-cut approach _t-- Branch-and-price approach _t-- Solution via heuristics, relaxations, and partitioning _t-- Solutions with commercial software _t-- Appendix : Answers to selected exercises
504			_aIncludes bibliographical references and index
650		0	_aInteger programming
700	1		_aBatson, Robert G., _d1950-
700	1		_aDang, Yu., _d1977-
900			_a30865
900			_bsatın
942			_2lcc _cKT
999			_c27704 _d27704