Integer Programming and Network Models (Hardcover)

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.