Introduction
Computational Problems
The classes P and NP
An NP-complete Set
More NP-Complete ProblemsHistorical Notes and References
Problems
Introduction
Linear Programming
Transition to Integer Solutions
Cutting Planes
Upper Bounds for Integer ProgramsHistorical Notes and References
Problems
Introduction
Enumerating 0-1 Integer Programs
Intellegent Solution Space Enumeration
General Branch and Bound AlgorithmsHistorical Notes and References
Problems
Introduction
A Shortest Path Problem
Characteristics and Approaches
More ExamplesHistorical Notes and References
Problems
Introduction
Bounds for Hueristics
Performance Analysis
Terminating Exact SolutionsHistorical Notes and References
Problems
Introduction
The Greedy Method
Divide and Conquer
Local Improvement
General Techniques for Local Search
Gradient MethodsHistorical Notes and References
Problems
Introduction
Force Directed Optimization
Simulated Annealing
Neural Networks
Genetic Algorithms
DNA Computing (Slides)Historical Notes and References
Problems