{"title":"George L. Nemhauser","description":"\u003cp\u003eExplore the insightful works of George L. Nemhauser, a distinguished figure in the field of optimisation and operations research. His contributions to \u003cem\u003eInteger and Combinatorial Optimization\u003c\/em\u003e are renowned for their depth and clarity, guiding both students and professionals towards a better understanding of complex mathematical theories.\u003c\/p\u003e\n\n\u003cp\u003eNemhauser's books, nestled in our Science \u0026amp; Nature section, delve into the intricate world of optimisation techniques, effectively bridging the gap between theoretical concepts and practical applications. His writings are particularly appreciated for their structured approach, helping readers grasp sophisticated ideas in an accessible manner.\u003c\/p\u003e\n\n\u003cp\u003eWhether you are a budding student or a seasoned researcher, George L. Nemhauser's works provide an essential foundation in the study of combinatorial optimisation, pushing the boundaries of what is possible in mathematical problem-solving.\u003c\/p\u003e","products":[{"product_id":"integer-and-combinatorial-optimization-by-laurence-a-wolsey-9780471359432","title":"Integer and Combinatorial Optimization","description":"\u003cdiv class=\"book-description\"\u003e\n\u003cp\u003eRave reviews for \u003cem\u003eInteger and Combinatorial Optimization\u003c\/em\u003e\u003c\/p\u003e\n\n\u003cp\u003e\"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.\" - \u003cem\u003eOptima\u003c\/em\u003e\u003c\/p\u003e\n\n\u003cp\u003e\"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 encyclopaedic resource for such formulations, as well as for understanding the structure of and solving the resulting integer programming problems.\" - \u003cem\u003eComputing Reviews\u003c\/em\u003e\u003c\/p\u003e\n\n\u003cp\u003e\"[This book] can serve as a basis for various graduate courses on discrete optimization as well as a reference book for researchers and practitioners.\" - \u003cem\u003eMathematical Reviews\u003c\/em\u003e\u003c\/p\u003e\n\n\u003cp\u003e\"This comprehensive and wide-ranging book will undoubtedly become a standard reference book for all those in the field of combinatorial optimization.\" - \u003cem\u003eBulletin of the London Mathematical Society\u003c\/em\u003e\u003c\/p\u003e\n\n\u003cp\u003e\"This text should be required reading for anybody who intends to do research in this area or even just to keep abreast of developments.\" - \u003cem\u003eTimes Higher Education Supplement, London\u003c\/em\u003e\u003c\/p\u003e\n\n\u003cp\u003eAlso of interest ... \u003cem\u003eInteger Programming\u003c\/em\u003e by Laurence A. Wolsey is a comprehensive and self-contained, intermediate-level guide to integer programming, providing 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.\u003c\/p\u003e\n\u003c\/div\u003e","brand":"Unknown","offers":[{"title":"Default Title","offer_id":46854609830124,"sku":"9780471359432","price":398.99,"currency_code":"NZD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0705\/7784\/8556\/files\/cc0eee779a10fea0c20708b832668f3a.jpg?v=1759267614"}],"url":"https:\/\/bookhero.live\/collections\/george-l-nemhauser.oembed","provider":"Book Hero","version":"1.0","type":"link"}