Cover Page
Title Page
Preface

CLASSES OF PROBLEMS

Introduction
Computational Problems
The classes P and NP
An NP-complete Set
More NP-Complete Problems

Historical Notes and References
Problems

INTEGER PROGRAMMING

Introduction
Linear Programming
Transition to Integer Solutions
Cutting Planes
Upper Bounds for Integer Programs

Historical Notes and References
Problems

ENUMERATION TECHNIQUES

Introduction
Enumerating 0-1 Integer Programs
Intellegent Solution Space Enumeration
General Branch and Bound Algorithms

Historical Notes and References
Problems

DYNAMIC PROGRAMMING

Introduction
A Shortest Path Problem
Characteristics and Approaches
More Examples

Historical Notes and References
Problems

APPROXIMATE SOLUTIONS

Introduction
Bounds for Hueristics
Performance Analysis
Terminating Exact Solutions

Historical Notes and References
Problems

LOCAL OPTIMIZATION

Introduction
The Greedy Method
Divide and Conquer
Local Improvement
General Techniques for Local Search
Gradient Methods

Historical Notes and References
Problems

NATURAL MODELS

Introduction
Force Directed Optimization
Simulated Annealing
Neural Networks
Genetic Algorithms
DNA Computing (Slides)

Historical Notes and References
Problems