Items related to Relaxation Methods for Pure and Mixed Integer Programming...
Synopsis
This book innovates mathematical procedures for solving integer programming (IP) problems, a fundamental category of optimization problems where variables can only take on whole number values. The techniques refine group theory methods by adjusting coefficients to reduce the complexity of induced finite abelian groups. The approach offers tighter constraints and more precise solutions. The author extends the applicability of group theory in IP by introducing relaxation methods that control group size, a significant obstacle in earlier applications. These methods show promise in resolving practical IP problems, as illustrated by computational experience. The book's significance lies in its contribution to the field of IP, providing a practical framework for solving complex problems with integer variables. Its insights enhance the utility of group theory methods and broaden their applicability in various domains.
"synopsis" may belong to another edition of this title.
About the Author
Jeremy Shapiro is a professor emeritus in the Sloan School of Management at MIT. For nine years he served as the co-director of MIT's Operations Research Center. Previously, he was employed by Procter and Gamble, Hughes Aircraft Company, and the Port of New York Authority. He received his B.M.E. and M.I.E. degrees from Cornell University and a Ph.D. degree in Operations Research from Stanford University. Dr. Shapiro has published over 60 papers in the areas of operations research, mathematical programming, logistics, supply chain management, finance, and marketing. He is also president of SLIM Technologies, LLC, a Boston-based firm specializing in the implementation and application of modeling systems for supply chain management and other business problems. His outside interests include reading, traveling, biking and playing tennis. He is married to Martha J. Heigham and has three children, Alexander, Lara, and Nicholas.
LAURENCE A. WOLSEY is Professor of Applied Mathematics at the Center for Operations Research and Econometrics (CORE) at l'UniversitA(c) Catholique de Louvain at Louvain-la-Neuve, Belgium. He is the author, with George Nemhauser, of Integer and Combinatorial Optimization (Wiley).
"About this title" may belong to another edition of this title.
Buy New
View this item
US$ 17.52
FREE shipping from United Kingdom to U.S.A.
Destination, rates & speedsOther Popular Editions of the Same Title
Search results for Relaxation Methods for Pure and Mixed Integer Programming...
Seller Image
Relaxation Methods for Pure and Mixed Integer Programming Problems
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Print on Demand. This book innovates mathematical procedures for solving integer programming (IP) problems, a fundamental category of optimization problems where variables can only take on whole number values. The techniques refine group theory methods by adjusting coefficients to reduce the complexity of induced finite abelian groups. The approach offers tighter constraints and more precise solutions. The author extends the applicability of group theory in IP by introducing relaxation methods that control group size, a significant obstacle in earlier applications. These methods show promise in resolving practical IP problems, as illustrated by computational experience. The book's significance lies in its contribution to the field of IP, providing a practical framework for solving complex problems with integer variables. Its insights enhance the utility of group theory methods and broaden their applicability in various domains. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Seller Inventory # 9781332278619_0
Quantity: Over 20 available
Stock Image
Relaxation Methods for Pure and Mixed Integer Programming Problems Classic Reprint
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332278619
Quantity: 15 available
Stock Image
Relaxation Methods for Pure and Mixed Integer Programming Problems Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332278619
Quantity: 15 available