A reference for those working at the interface of operations planning and optimization modeling, this book blends essential theory and powerful approaches to practical operations planning problems. Starting with the Knapsack Problem, it presents a set of classical optimization models with widespread application in operations planning. The discussion of each of these classical models begins with the motivation for studying the problem as well as examples of the problem’s application in operations planning contexts. The book explores special structural results and properties of optimal solutions that have led to effective algorithmic solution approaches for each problem class.
Prefece
Chapter 1 : Introduction and Purpose
Chapter 2 : The Knapsack Problem
Chapter 3 : Set Covering, Packing, and Partitioning
Chapter 4 : The Generalized Assignment Problem
Chapter 5 : Incapacitated Economic Lot Sizing
Chapter 6 : Capacitated Lot Sizing
Chapter 7 : Discrete Facility Location Problems
Chapter 8 : Vehicle Routing and Traveling Salesman Problems
Index
