Integer and Combinatorial Optimization
08.2014β―Π³. Β· John Wiley & Sons
3,0star
1Β ΠΎΡΠ·ΠΈΠ²report
ΠΠ»Π΅ΠΊΡΡΠΎΠ½Π½Π° ΠΊΠ½ΠΈΠ³Π°
784
Π‘ΡΡΠ°Π½ΠΈΡΠΈ
reportΠΡΠ΅Π½ΠΊΠΈΡΠ΅ ΠΈ ΠΎΡΠ·ΠΈΠ²ΠΈΡΠ΅ Π½Π΅ ΡΠ° ΠΏΠΎΡΠ²ΡΡΠ΄Π΅Π½ΠΈ Β ΠΠ°ΡΡΠ΅ΡΠ΅ ΠΏΠΎΠ²Π΅ΡΠ΅
ΠΡΠΈΡΠΊΠΎ Π·Π° ΡΠ°Π·ΠΈ Π΅Π»Π΅ΠΊΡΡΠΎΠ½Π½Π° ΠΊΠ½ΠΈΠ³Π°
Rave reviews for INTEGER AND COMBINATORIAL OPTIMIZATION
"This book provides an excellent introduction and survey of traditional fields of combinatorial optimization . . . It is indeed one of the best and most complete texts on combinatorial optimization . . . available. [And] with more than 700 entries, [it] has quite an exhaustive reference list."-Optima
"A unifying approach to optimization problems is to formulate them like linear programming problems, while restricting some or all of the variables to the integers. This book is an encyclopedic resource for such formulations, as well as for understanding the structure of and solving the resulting integer programming problems."-Computing Reviews
"[This book] can serve as a basis for various graduate courses on discrete optimization as well as a reference book for researchers and practitioners."-Mathematical Reviews
"This comprehensive and wide-ranging book will undoubtedly become a standard reference book for all those in the field of combinatorial optimization."-Bulletin of the London Mathematical Society
"This text should be required reading for anybody who intends to do research in this area or even just to keep abreast of developments."-Times Higher Education Supplement, London
Also of interest . . .
INTEGER PROGRAMMING Laurence A. Wolsey Comprehensive and self-contained, this intermediate-level guide to integer programming provides readers with clear, up-to-date explanations on why some problems are difficult to solve, how techniques can be reformulated to give better results, and how mixed integer programming systems can be used more effectively. 1998 (0-471-28366-5) 260 pp.
"This book provides an excellent introduction and survey of traditional fields of combinatorial optimization . . . It is indeed one of the best and most complete texts on combinatorial optimization . . . available. [And] with more than 700 entries, [it] has quite an exhaustive reference list."-Optima
"A unifying approach to optimization problems is to formulate them like linear programming problems, while restricting some or all of the variables to the integers. This book is an encyclopedic resource for such formulations, as well as for understanding the structure of and solving the resulting integer programming problems."-Computing Reviews
"[This book] can serve as a basis for various graduate courses on discrete optimization as well as a reference book for researchers and practitioners."-Mathematical Reviews
"This comprehensive and wide-ranging book will undoubtedly become a standard reference book for all those in the field of combinatorial optimization."-Bulletin of the London Mathematical Society
"This text should be required reading for anybody who intends to do research in this area or even just to keep abreast of developments."-Times Higher Education Supplement, London
Also of interest . . .
INTEGER PROGRAMMING Laurence A. Wolsey Comprehensive and self-contained, this intermediate-level guide to integer programming provides readers with clear, up-to-date explanations on why some problems are difficult to solve, how techniques can be reformulated to give better results, and how mixed integer programming systems can be used more effectively. 1998 (0-471-28366-5) 260 pp.
ΠΡΠ΅Π½ΠΊΠΈ ΠΈ ΠΎΡΠ·ΠΈΠ²ΠΈ
3,0
1Β ΠΎΡΠ·ΠΈΠ²
ΠΠ° Π°Π²ΡΠΎΡΠ°
LAURENCE A. WOLSEY is Professor of Applied Mathematics at the Center for Operations Research and Econometrics at l'Universite Catholique de Louvain at Louvain-la-Neuve, Belgium. He is the author, with George Nemhauser, of Integer and Combinatorial Optimization.
GEORGE NEMHAUSER is an A. Russell Chandler III Chair and Institute Professor in the H. Milton Stewart School of Industrial and Systems Engineering at Georgia Tech.
ΠΡΠ΅Π½Π΅ΡΠ΅ ΡΠ°Π·ΠΈ Π΅Π»Π΅ΠΊΡΡΠΎΠ½Π½Π° ΠΊΠ½ΠΈΠ³Π°
ΠΠ°ΠΆΠ΅ΡΠ΅ Π½ΠΈ ΠΊΠ°ΠΊΠ²ΠΎ ΠΌΠΈΡΠ»ΠΈΡΠ΅.
ΠΠ½ΡΠΎΡΠΌΠ°ΡΠΈΡ Π·Π° ΡΠ΅ΡΠ΅Π½Π΅ΡΠΎ
Π‘ΠΌΠ°ΡΡΡΠΎΠ½ΠΈ ΠΈ ΡΠ°Π±Π»Π΅ΡΠΈ
ΠΠ½ΡΡΠ°Π»ΠΈΡΠ°ΠΉΡΠ΅ ΠΏΡΠΈΠ»ΠΎΠΆΠ΅Π½ΠΈΠ΅ΡΠΎ Google Play ΠΠ½ΠΈΠ³ΠΈ Π·Π° Android ΠΈ iPad/iPhone. Π’ΠΎ Π°Π²ΡΠΎΠΌΠ°ΡΠΈΡΠ½ΠΎ ΡΠ΅ ΡΠΈΠ½Ρ
ΡΠΎΠ½ΠΈΠ·ΠΈΡΠ° Ρ ΠΏΡΠΎΡΠΈΠ»Π° Π²ΠΈ ΠΈ Π²ΠΈ ΠΏΠΎΠ·Π²ΠΎΠ»ΡΠ²Π° Π΄Π° ΡΠ΅ΡΠ΅ΡΠ΅ ΠΎΠ½Π»Π°ΠΉΠ½ ΠΈΠ»ΠΈ ΠΎΡΠ»Π°ΠΉΠ½, ΠΊΡΠ΄Π΅ΡΠΎ ΠΈ Π΄Π° ΡΡΠ΅.
ΠΠ°ΠΏΡΠΎΠΏΠΈ ΠΈ ΠΊΠΎΠΌΠΏΡΡΡΠΈ
ΠΠΎΠΆΠ΅ΡΠ΅ Π΄Π° ΡΠ»ΡΡΠ°ΡΠ΅ Π·Π°ΠΊΡΠΏΠ΅Π½ΠΈΡΠ΅ ΠΎΡ Google Play Π°ΡΠ΄ΠΈΠΎΠΊΠ½ΠΈΠ³ΠΈ ΠΏΠΎΡΡΠ΅Π΄ΡΡΠ²ΠΎΠΌ ΡΠ΅Π± Π±ΡΠ°ΡΠ·ΡΡΠ° Π½Π° ΠΊΠΎΠΌΠΏΡΡΡΡΠ° ΡΠΈ.
ΠΠ»Π΅ΠΊΡΡΠΎΠ½Π½ΠΈ ΡΠ΅ΡΡΠΈ ΠΈ Π΄ΡΡΠ³ΠΈ ΡΡΡΡΠΎΠΉΡΡΠ²Π°
ΠΠ° Π΄Π° ΡΠ΅ΡΠ΅ΡΠ΅ Π½Π° ΡΡΡΡΠΎΠΉΡΡΠ²Π° Ρ Π΅Π»Π΅ΠΊΡΡΠΎΠ½Π½ΠΎ ΠΌΠ°ΡΡΠΈΠ»ΠΎ, ΠΊΠ°ΡΠΎ Π½Π°ΠΏΡΠΈΠΌΠ΅Ρ Π΅Π»Π΅ΠΊΡΡΠΎΠ½Π½ΠΈΡΠ΅ ΡΠ΅ΡΡΠΈ ΠΎΡ Kobo, ΡΡΡΠ±Π²Π° Π΄Π° ΠΈΠ·ΡΠ΅Π³Π»ΠΈΡΠ΅ ΡΠ°ΠΉΠ» ΠΈ Π΄Π° Π³ΠΎ ΠΏΡΠ΅Ρ
Π²ΡΡΠ»ΠΈΡΠ΅ Π½Π° ΡΡΡΡΠΎΠΉΡΡΠ²ΠΎΡΠΎ ΡΠΈ. ΠΠ·ΠΏΡΠ»Π½Π΅ΡΠ΅ ΠΏΠΎΠ΄ΡΠΎΠ±Π½ΠΈΡΠ΅ ΠΈΠ½ΡΡΡΡΠΊΡΠΈΠΈ Π² ΠΠΎΠΌΠΎΡΠ½ΠΈΡ ΡΠ΅Π½ΡΡΡ, Π·Π° Π΄Π° ΠΏΡΠ΅Ρ
Π²ΡΡΠ»ΠΈΡΠ΅ ΡΠ°ΠΉΠ»ΠΎΠ²Π΅ΡΠ΅ Π² ΠΏΠΎΠ΄Π΄ΡΡΠΆΠ°Π½ΠΈΡΠ΅ Π΅Π»Π΅ΠΊΡΡΠΎΠ½Π½ΠΈ ΡΠ΅ΡΡΠΈ.
