{"product_id":"integer-programming-isbn-9781119606536","title":"Integer Programming","description":"\u003cp\u003e\u003cb\u003eA PRACTICAL GUIDE TO OPTIMIZATION PROBLEMS WITH DISCRETE OR INTEGER VARIABLES, REVISED AND UPDATED\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003eThe revised second edition of \u003ci\u003eInteger Programming\u003c\/i\u003e explains in clear and simple terms how to construct custom-made algorithms or use existing commercial software to obtain optimal or near-optimal solutions for a variety of real-world problems. The second edition also includes information on the remarkable progress in the development of mixed integer programming solvers in the 22 years since the first edition of the book appeared. The updated text includes information on the most recent developments in the field such as the much improved preprocessing\/presolving and the many new ideas for primal heuristics included in the solvers. The result has been a speed-up of several orders of magnitude. The other major change reflected in the text is the widespread use of decomposition algorithms, in particular column generation (branch-(cut)-and-price) and Benders’ decomposition. The revised second edition:\u003c\/p\u003e \u003cul\u003e \u003cli\u003eContains new developments on column generation\u003c\/li\u003e \u003cli\u003eOffers a new chapter on Benders’ algorithm\u003c\/li\u003e \u003cli\u003eIncludes expanded information on preprocessing, heuristics, and branch-and-cut\u003c\/li\u003e \u003cli\u003ePresents several basic and extended formulations, for example for fixed cost\u003c\/li\u003e \u003cli\u003enetwork flows\u003c\/li\u003e \u003cli\u003eAlso touches on and briefly introduces topics such as non-bipartite matching, the complexity of extended formulations or a good linear program for the implementation of lift-and-project \u003c\/li\u003e \u003c\/ul\u003e \u003cp\u003eWritten for students of integer\/mathematical programming in operations research, mathematics, engineering, or computer science, Integer Programming offers an updated edition of the basic text that reflects the most recent developments in the field.\u003c\/p\u003e \u003cp\u003ePreface to the Second Edition xii\u003c\/p\u003e \u003cp\u003ePreface to the First Edition xiii\u003c\/p\u003e \u003cp\u003eAbbreviations and Notation xvii\u003c\/p\u003e \u003cp\u003eAbout the Companion Website xix\u003c\/p\u003e \u003cp\u003e\u003cb\u003e1 Formulations \u003c\/b\u003e\u003cb\u003e1\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e1.1 Introduction 1\u003c\/p\u003e \u003cp\u003e1.2 What Is an Integer Program? 3\u003c\/p\u003e \u003cp\u003e1.3 Formulating IPs and BIPs 5\u003c\/p\u003e \u003cp\u003e1.4 The Combinatorial Explosion 8\u003c\/p\u003e \u003cp\u003e1.5 Mixed Integer Formulations 9\u003c\/p\u003e \u003cp\u003e1.6 Alternative Formulations 12\u003c\/p\u003e \u003cp\u003e1.7 Good and Ideal Formulations 15\u003c\/p\u003e \u003cp\u003e1.8 Notes 18\u003c\/p\u003e \u003cp\u003e1.9 Exercises 19\u003c\/p\u003e \u003cp\u003e\u003cb\u003e2 Optimality, Relaxation, and Bounds \u003c\/b\u003e\u003cb\u003e25\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e2.1 Optimality and Relaxation 25\u003c\/p\u003e \u003cp\u003e2.2 Linear Programming Relaxations 27\u003c\/p\u003e \u003cp\u003e2.3 Combinatorial Relaxations 28\u003c\/p\u003e \u003cp\u003e2.4 Lagrangian Relaxation 29\u003c\/p\u003e \u003cp\u003e2.5 Duality 30\u003c\/p\u003e \u003cp\u003e2.6 Linear Programming and Polyhedra 32\u003c\/p\u003e \u003cp\u003e2.7 Primal Bounds: Greedy and Local Search 34\u003c\/p\u003e \u003cp\u003e2.8 Notes 38\u003c\/p\u003e \u003cp\u003e2.9 Exercises 38\u003c\/p\u003e \u003cp\u003e\u003cb\u003e3 Well-Solved Problems \u003c\/b\u003e\u003cb\u003e43\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e3.1 Properties of Easy Problems 43\u003c\/p\u003e \u003cp\u003e3.2 IPs with Totally Unimodular Matrices 44\u003c\/p\u003e \u003cp\u003e3.3 Minimum Cost Network Flows 46\u003c\/p\u003e \u003cp\u003e3.4 Special Minimum Cost Flows 48\u003c\/p\u003e \u003cp\u003e3.4.1 Shortest Path 48\u003c\/p\u003e \u003cp\u003e3.4.2 Maximum \u003ci\u003es \u003c\/i\u003e− \u003ci\u003et \u003c\/i\u003eFlow 49\u003c\/p\u003e \u003cp\u003e3.5 Optimal Trees 50\u003c\/p\u003e \u003cp\u003e3.6 Submodularity and Matroids 54\u003c\/p\u003e \u003cp\u003e3.7 Two Harder Network Flow Problems 57\u003c\/p\u003e \u003cp\u003e3.8 Notes 59\u003c\/p\u003e \u003cp\u003e3.9 Exercises 60\u003c\/p\u003e \u003cp\u003e\u003cb\u003e4 Matchings and Assignments \u003c\/b\u003e\u003cb\u003e63\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e4.1 Augmenting Paths and Optimality 63\u003c\/p\u003e \u003cp\u003e4.2 Bipartite Maximum Cardinality Matching 65\u003c\/p\u003e \u003cp\u003e4.3 The Assignment Problem 67\u003c\/p\u003e \u003cp\u003e4.4 Matchings in Nonbipartite Graphs 73\u003c\/p\u003e \u003cp\u003e4.5 Notes 74\u003c\/p\u003e \u003cp\u003e4.6 Exercises 75\u003c\/p\u003e \u003cp\u003e\u003cb\u003e5 Dynamic Programming \u003c\/b\u003e\u003cb\u003e79\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e5.1 Some Motivation: Shortest Paths 79\u003c\/p\u003e \u003cp\u003e5.2 Uncapacitated Lot-Sizing 80\u003c\/p\u003e \u003cp\u003e5.3 An Optimal Subtree of a Tree 83\u003c\/p\u003e \u003cp\u003e5.4 Knapsack Problems 84\u003c\/p\u003e \u003cp\u003e5.4.1 0–1 Knapsack Problems 85\u003c\/p\u003e \u003cp\u003e5.4.2 Integer Knapsack Problems 86\u003c\/p\u003e \u003cp\u003e5.5 The Cutting Stock Problem 89\u003c\/p\u003e \u003cp\u003e5.6 Notes 91\u003c\/p\u003e \u003cp\u003e5.7 Exercises 92\u003c\/p\u003e \u003cp\u003e\u003cb\u003e6 Complexity and Problem Reductions \u003c\/b\u003e\u003cb\u003e95\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e6.1 Complexity 95\u003c\/p\u003e \u003cp\u003e6.2 Decision Problems, and Classes \u003ci\u003eNP\u003c\/i\u003e and \u003ci\u003eP\u003c\/i\u003e 96\u003c\/p\u003e \u003cp\u003e6.3 Polynomial Reduction and the Class \u003ci\u003eNPC\u003c\/i\u003e 98\u003c\/p\u003e \u003cp\u003e6.4 Consequences of P =NP orP ≠NP 103\u003c\/p\u003e \u003cp\u003e6.5 Optimization and Separation 104\u003c\/p\u003e \u003cp\u003e6.6 The Complexity of Extended Formulations 105\u003c\/p\u003e \u003cp\u003e6.7 Worst-Case Analysis of Heuristics 106\u003c\/p\u003e \u003cp\u003e6.8 Notes 109\u003c\/p\u003e \u003cp\u003e6.9 Exercises 110\u003c\/p\u003e \u003cp\u003e\u003cb\u003e7 Branch and Bound \u003c\/b\u003e\u003cb\u003e113\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e7.1 Divide and Conquer 113\u003c\/p\u003e \u003cp\u003e7.2 Implicit Enumeration 114\u003c\/p\u003e \u003cp\u003e7.3 Branch and Bound: an Example 116\u003c\/p\u003e \u003cp\u003e7.4 LP-Based Branch and Bound 120\u003c\/p\u003e \u003cp\u003e7.5 Using a Branch-and-Bound\/Cut System 123\u003c\/p\u003e \u003cp\u003e7.6 Preprocessing or Presolve 129\u003c\/p\u003e \u003cp\u003e7.7 Notes 134\u003c\/p\u003e \u003cp\u003e7.8 Exercises 135\u003c\/p\u003e \u003cp\u003e\u003cb\u003e8 Cutting Plane Algorithms \u003c\/b\u003e\u003cb\u003e139\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e8.1 Introduction 139\u003c\/p\u003e \u003cp\u003e8.2 Some Simple Valid Inequalities 140\u003c\/p\u003e \u003cp\u003e8.3 Valid Inequalities 143\u003c\/p\u003e \u003cp\u003e8.4 A Priori Addition of Constraints 147\u003c\/p\u003e \u003cp\u003e8.5 Automatic Reformulation or Cutting Plane Algorithms 149\u003c\/p\u003e \u003cp\u003e8.6 Gomory’s Fractional Cutting Plane Algorithm 150\u003c\/p\u003e \u003cp\u003e8.7 Mixed Integer Cuts 153\u003c\/p\u003e \u003cp\u003e8.7.1 The Basic Mixed Integer Inequality 153\u003c\/p\u003e \u003cp\u003e8.7.2 The Mixed Integer Rounding (MIR) Inequality 155\u003c\/p\u003e \u003cp\u003e8.7.3 The Gomory Mixed Integer Cut 155\u003c\/p\u003e \u003cp\u003e8.7.4 Split Cuts 156\u003c\/p\u003e \u003cp\u003e8.8 Disjunctive Inequalities and Lift-and-Project 158\u003c\/p\u003e \u003cp\u003e8.9 Notes 161\u003c\/p\u003e \u003cp\u003e8.10 Exercises 162\u003c\/p\u003e \u003cp\u003e\u003cb\u003e9 Strong Valid Inequalities \u003c\/b\u003e\u003cb\u003e167\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e9.1 Introduction 167\u003c\/p\u003e \u003cp\u003e9.2 Strong Inequalities 168\u003c\/p\u003e \u003cp\u003e9.3 0–1 Knapsack Inequalities 175\u003c\/p\u003e \u003cp\u003e9.3.1 Cover Inequalities 175\u003c\/p\u003e \u003cp\u003e9.3.2 Strengthening Cover Inequalities 176\u003c\/p\u003e \u003cp\u003e9.3.3 Separation for Cover Inequalities 178\u003c\/p\u003e \u003cp\u003e9.4 Mixed 0–1 Inequalities 179\u003c\/p\u003e \u003cp\u003e9.4.1 Flow Cover Inequalities 179\u003c\/p\u003e \u003cp\u003e9.4.2 Separation for Flow Cover Inequalities 181\u003c\/p\u003e \u003cp\u003e9.5 The Optimal Subtour Problem 183\u003c\/p\u003e \u003cp\u003e9.5.1 Separation for Generalized Subtour Constraints 183\u003c\/p\u003e \u003cp\u003e9.6 Branch-and-Cut 186\u003c\/p\u003e \u003cp\u003e9.7 Notes 189\u003c\/p\u003e \u003cp\u003e9.8 Exercises 190\u003c\/p\u003e \u003cp\u003e\u003cb\u003e10 Lagrangian Duality \u003c\/b\u003e\u003cb\u003e195\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e10.1 Lagrangian Relaxation 195\u003c\/p\u003e \u003cp\u003e10.2 The Strength of the Lagrangian Dual 200\u003c\/p\u003e \u003cp\u003e10.3 Solving the Lagrangian Dual 202\u003c\/p\u003e \u003cp\u003e10.4 Lagrangian Heuristics 205\u003c\/p\u003e \u003cp\u003e10.5 Choosing a Lagrangian Dual 207\u003c\/p\u003e \u003cp\u003e10.6 Notes 209\u003c\/p\u003e \u003cp\u003e10.7 Exercises 210\u003c\/p\u003e \u003cp\u003e\u003cb\u003e11 Column (and Row) Generation Algorithms \u003c\/b\u003e\u003cb\u003e213\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e11.1 Introduction 213\u003c\/p\u003e \u003cp\u003e11.2 The Dantzig–Wolfe Reformulation of an IP 215\u003c\/p\u003e \u003cp\u003e11.3 Solving the LP Master Problem: Column Generation 216\u003c\/p\u003e \u003cp\u003e11.4 Solving the Master Problem: Branch-and-Price 219\u003c\/p\u003e \u003cp\u003e11.5 Problem Variants 222\u003c\/p\u003e \u003cp\u003e11.5.1 Handling Multiple Subproblems 222\u003c\/p\u003e \u003cp\u003e11.5.2 Partitioning\/Packing Problems with Additional Variables 223\u003c\/p\u003e \u003cp\u003e11.5.3 Partitioning\/Packing Problems with Identical Subsets 224\u003c\/p\u003e \u003cp\u003e11.6 Computational Issues 225\u003c\/p\u003e \u003cp\u003e11.7 Branch-Cut-and-Price: An Example 226\u003c\/p\u003e \u003cp\u003e11.7.1 A Capacitated Vehicle Routing Problem 226\u003c\/p\u003e \u003cp\u003e11.7.2 Solving the Subproblems 229\u003c\/p\u003e \u003cp\u003e11.7.3 The Load Formulation 230\u003c\/p\u003e \u003cp\u003e11.8 Notes 231\u003c\/p\u003e \u003cp\u003e11.9 Exercises 232\u003c\/p\u003e \u003cp\u003e\u003cb\u003e12 Benders’ Algorithm \u003c\/b\u003e\u003cb\u003e235\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e12.1 Introduction 235\u003c\/p\u003e \u003cp\u003e12.2 Benders’ Reformulation 236\u003c\/p\u003e \u003cp\u003e12.3 Benders’ with Multiple Subproblems 240\u003c\/p\u003e \u003cp\u003e12.4 Solving the Linear Programming Subproblems 242\u003c\/p\u003e \u003cp\u003e12.5 Integer Subproblems: Basic Algorithms 244\u003c\/p\u003e \u003cp\u003e12.5.1 Branching in the (\u003ci\u003ex, \u003c\/i\u003e\u003ci\u003e𝜂, y\u003c\/i\u003e)-Space 244\u003c\/p\u003e \u003cp\u003e12.5.2 Branching in (\u003ci\u003ex, \u003c\/i\u003e\u003ci\u003e𝜂\u003c\/i\u003e)-Space and “No-Good” Cuts 246\u003c\/p\u003e \u003cp\u003e12.6 Notes 247\u003c\/p\u003e \u003cp\u003e12.7 Exercises 248\u003c\/p\u003e \u003cp\u003e\u003cb\u003e13 Primal Heuristics \u003c\/b\u003e251\u003c\/p\u003e \u003cp\u003e13.1 Introduction 251\u003c\/p\u003e \u003cp\u003e13.2 Greedy and Local Search Revisited 252\u003c\/p\u003e \u003cp\u003e13.3 Improved Local Search Heuristics 255\u003c\/p\u003e \u003cp\u003e13.3.1 Tabu Search 255\u003c\/p\u003e \u003cp\u003e13.3.2 Simulated Annealing 256\u003c\/p\u003e \u003cp\u003e13.3.3 Genetic Algorithms 257\u003c\/p\u003e \u003cp\u003e13.4 Heuristics Inside MIP Solvers 259\u003c\/p\u003e \u003cp\u003e13.4.1 Construction Heuristics 259\u003c\/p\u003e \u003cp\u003e13.4.2 Improvement Heuristics 261\u003c\/p\u003e \u003cp\u003e13.5 User-Defined MIP heuristics 262\u003c\/p\u003e \u003cp\u003e13.6 Notes 265\u003c\/p\u003e \u003cp\u003e13.7 Exercises 266\u003c\/p\u003e \u003cp\u003e\u003cb\u003e14 From Theory to Solutions \u003c\/b\u003e\u003cb\u003e269\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e14.1 Introduction 269\u003c\/p\u003e \u003cp\u003e14.2 Software for Solving Integer Programs 269\u003c\/p\u003e \u003cp\u003e14.3 How Do We Find an Improved Formulation? 272\u003c\/p\u003e \u003cp\u003e14.4 Multi-item Single Machine Lot-Sizing 277\u003c\/p\u003e \u003cp\u003e14.5 A Multiplexer Assignment Problem 282\u003c\/p\u003e \u003cp\u003e14.6 Integer Programming and Machine Learning 285\u003c\/p\u003e \u003cp\u003e14.7 Notes 287\u003c\/p\u003e \u003cp\u003e14.8 Exercises 287\u003c\/p\u003e \u003cp\u003eReferences 291\u003c\/p\u003e \u003cp\u003eIndex 311\u003c\/p\u003e  \u003cp\u003e\u003cb\u003eLAURENCE A. WOLSEY\u003c\/b\u003e is a mathematician working in the field of integer programming. He is a former president and research director of the Center for Operations Research and Econometrics (CORE) at UCLouvain in Belgium where he is Emeritus Professor of applied mathematics in the Engineering school.   \u003c\/p\u003e\u003cp\u003e\u003cb\u003eA PRACTICAL GUIDE TO OPTIMIZATION PROBLEMS WITH DISCRETE OR INTEGER VARIABLES, REVISED AND UPDATED\u003c\/b\u003e \u003c\/p\u003e\u003cp\u003eThe revised second edition of Integer Programming explains in clear and simple terms how to construct custom-made algorithms or use existing commercial software to obtain optimal or near-optimal solutions for a variety of real-world problems. The second edition also includes information on the remarkable progress in the development of mixed integer programming solvers in the 22 years since the first edition of the book appeared. The updated text includes information on the most recent developments in the field such as the much improved preprocessing\/presolving and the many new ideas for primal heuristics included in the solvers. The result has been a speed-up of several orders of magnitude. The other major change reflected in the text is the widespread use of decomposition algorithms, in particular column generation (branch-(cut)-and-price) and Benders' decomposition. The revised second edition:  \u003c\/p\u003e\u003cul\u003e \u003cli\u003eContains new developments on column generation\u003c\/li\u003e \u003cli\u003eOffers a new chapter on Benders' algorithm\u003c\/li\u003e \u003cli\u003eIncludes expanded information on preprocessing, heuristics, and branch-and-cut\u003c\/li\u003e \u003cli\u003ePresents several basic and extended formulations, for example for fixed cost network flows\u003c\/li\u003e \u003cli\u003eBriefly introduces topics such as non-bipartite matching, the complexity of extended formulations or a good linear program for the implementation of lift-and-project\u003c\/li\u003e \u003c\/ul\u003e  \u003cp\u003eWritten for students of integer\/mathematical programming in operations research, mathematics, engineering, or computer science, Integer Programming offers an updated edition of the basic text that reflects the most recent developments in the field.\u003c\/p\u003e","brand":"Wiley","offers":[{"title":"Default Title","offer_id":47989434843365,"sku":"NP9781119606536","price":102.0,"currency_code":"USD","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/1842\/7735\/files\/9781119606536.jpg?v=1761784089","url":"https:\/\/k12savings.com\/products\/integer-programming-isbn-9781119606536","provider":"K12savings","version":"1.0","type":"link"}