H.A. Eiselt, Carl-Louis Sandblom

Integer Programming and Network Models

Mitarbeit:Spielberg, K.; Richards, E.; Smith, B.T.; Laporte, G.; Boffey, B.T.

• Broschiertes Buch

Produktbeschreibung

The purpose of this book is to provide readers with an introduction to the very active field of integer programming and network models. The idea is to cover the main parts of the field without being too detailed or too technical. As a matter of fact, we found it somewhat surprising that most--especially newer---books are strongly algorithmically oriented. In contrast, the main emphasis of this book is on models rather than methods. This focus expresses our view that methods are tools to solve actual problems and not ends in themselves. As such, graduate (and with some omissions, undergraduate) students may find this book helpful in their studies as will practitioners who would like to get acquainted with a field or use this text as a refresher. This premise has resulted in a coverage that omits material that is standard fare in other books, whereas it covers topics that are only infrequently found elsewhere. There are some, yet relatively few, prerequisites for the reader. Most material that is required for the understanding of more than one chapter is presented in one of the four chapters of the introductory part, which reviews the main results in linear programming, the analysis of algorithms, graphs and networks, and dynamic programming, respectively. Readers who are familiar with the issues involved can safely skip that part. The three main parts of the book rely on intuitive reasoning and examples, whenever practical, instead of theorems and proofs.

Produktdetails

• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 978-3-642-08651-9
• Softcover reprint of hardcover 1st ed. 2000
• Seitenzahl: 520
• Erscheinungstermin: 15. Dezember 2010
• Englisch
• Abmessung: 235mm x 155mm x 28mm
• Gewicht: 780g
• ISBN-13: 9783642086519
• ISBN-10: 3642086519
• Artikelnr.: 32056217

Inhaltsangabe

Introduction: Basic Definitions and Results.- a Linear Programming.- b Analysis of Algorithms.- c Graph Theory.- d Dynamic Programming.- I: Integer Programming.- 1 The Integer Programming Problem and its Properties.- 2 Formulations in Logical Variables.- 3 Applications and Special Structures.- 4 Reformulation of Problems.- 5 Cutting Plane Methods.- 6 Branch and Bound Methods.- 7 Heuristic Algorithms.- II: Network Path Models.- 1 Tree Networks.- 2 Shortest Path Problems.- 3 Traveling Salesman Problems and Extensions.- 4 Arc Routing.- III: Network Flow and Network Design Models.- 1 Basic Principles of Network Models.- 2 Applications of Network Flow Models.- 3 Network Flow Algorithms.- 4 Multicommodity Network Flows.- 5 Networks with Congestion.- References.