In recent years there has been an explosion of research into linear programming, as well as further steady advances in integer programming. This research has been reported in the literature, but little has been done from the view of a combined whole. This book aims to overcome this. With an international authorship of contributors from acknowledged experts in their field, it provides a clear exposition on such topics as simplex algorithms, interior point algorithms, and integer programming. Surveying recent research that is currently only available in journals, this topical book will be of interest not only in the field of mathematics, but in computer science and operations research as well.
List of contributors 1. Simplex Algorithms 2. Interior Point Methods 3. A Computational View of Interior Point Methods 4. Interior Point Algorithms for Network Flow Problems 5. Banach and Cut Algorithms 6. Interior Point Algorithms for Integer Programming 7. Computational Logic and Integer Programming