Complex Scheduling

This book presents models and algorithms for complex scheduling problems. Discrete optimization methods like linear and integer programming, constraint propagation techniques, shortest path and network flow algorithms, branch-and-bound methods, local search and genetic algorithms, and dynamic programming are presented.

Aceasta carte prezinta modele si algoritmi pentru probleme complexe de planificare. Sunt prezentate metode de optimizare discreta, cum ar fi programarea liniara si intreaga, tehnici de propagare a constrangerilor, algoritmi de curgere si flux de retea mai scurte, metode ramificate si legate, cautare locala si algoritmi genetici si programare dinamica.