Synopses & Reviews
The book presents a unified treatment of integer programming and network models with topics ranging from exact and heuristic algorithms to network flows, traveling salesman tours, and traffic assignment problems. While the emphasis of the book is on models and applications, the most important methods and algorithms are described in detail and illustrated by numerical examples. The formulations and the discussion of a large variety of models provides insight into their structures that allows the user to better evaluate the solutions to the problems.
Table of Contents
Basic Definitions and Results: Some Results in Linear Programming.- An Introduction to the Analysis of Algorithms.- Introduction to Graph Theory.- Dynamic Programming.-
Integer Programming: The Integer Programming Problem and its Properties.- Formulations in Logical Variables.- Applications and Special Structures.- Reformulation of Problems.- Cutting Plane Methods.- Branch and Bound Methods.- Heuristic Algorithms.-
Network Path Models: Tree Networks.- Shortest Path Problems.- Traveling Salesman Problems and Extensions.- Arc Routing.-
Network Flow and Network Design Models: Basic Principles of Network Flow Models.- Applications of Network Flow Models.- Network Flow Algorithms.- Multicommodity Network Flows.- Networks with Congestion.