Next:
List of Figures
Up:
No Title
Previous:
No Title
Contents
List of Figures
List of Tables
Introduction
Combinatorial Optimization
Graph Coloring and Course Scheduling
Graph Coloring
Course Scheduling
Methods
Temporal Hard Constraints
Simulated Annealing
The Annealing Schedules
White cooling schedule
Lundy-Mees Schedule
Huang-Romeo-Sangiovanni schedule
Applications
Genetic Algorithms (GAs)
Tabu Search
References
Neural Network Algorithms
The Hopfield Net
Operation and Update of the State Neurons
Stability of the network
Mapping the problem onto the network
Mean Field Annealing
Brief Background
MFA variables: from Ising to the Potts model
Conclusion
Other Variants and Models of Neural Networks
references
Lagrangean Relaxation Method
Lin-Kernighan heuristics (LK)
Graphs and Combinatorial Optimization
Graphs and Digraphs
Computer Representation of Graphs and Digraphs
Shortest Path Problems
Dijkstra Algorithm for Shortest Path
Shortest Spanning Trees
Prim's Algorithm for Shortest Spanning Trees
Application of Prim's Algorithm
Networks
Ford-Fulkerson algorithm for Max Flow
Assignment Problems
Summary (A)
Matching Algorithms
The Labeling Algorithm
The Transportation Problem
Summary (B)
Linear Programming
The Simplex and Karmarkar's Methods
Saddle Points (Minimax) and Game Theory
Optimization and Nonlinear Programming
References
References on the World Wide Web
Glossary
References
About this document ...
HPF demo web account
Mon Nov 18 19:45:42 EST 1996