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.
Toode on otsas
Detailid
Lehekülgede arv342 lehekülge
VormPehmekaaneline
Lugemise aeg11:24 tundi
Arvutus põhineb keskmisel lugemiskiirusel, kus 200-250 sõna lugemiseks kulub 2 minutit.