This book addresses a new method for generating tight linear or convex programming relaxations for discrete and continuous nonconvex programming problems. Problems of this type arise in many economics, location-allocation, scheduling and routing, and process control and engineering design... read more
We’re hiding the errata, movie connections, books that influenced this book, books influenced by this book, books that cite this book and books cited by this book sections. If you would like to add content to them, you must first make them visible.