27 июня 2009 | Автор: Admin | Рубрика: Компьютерная литература » Програм-ние и разработка » Программирование | Комментариев: 0
Probabilistic Analysis of Packing and Partitioning Algorithms (Wiley-Interscience Series in Discrete Mathematics and Optimization): E. G. Coffman, George S. Lueker
John Wiley & Sons | ISBN: 047153272X | 1991-04 | djvu (ocr) | 192 pages | 1.66 Mb
This volume examines two important classes that are characteristic of combinatorial optimization problems: sequencing and scheduling (in which a set of objects has to be ordered subject to a number of conditions), and packing and partitioning (in which a set of objects has to be split into subsets in order to meet a certain objective). These classes of problems encompass a wide range of practical applications, from production planning and flexible manufacturing to computer scheduling and VLSI design.