We survey the main results presented in the author’s Ph.D Thesis (Monaci 2001), discussed on January 2002 at the University of Bologna (Italy) and supervised by Paolo Toth and Silvano Martello. The thesis deals with exact and heuristic approaches for solving a class of combinatorial optimization problems, with particular emphasis on Two-Dimensional Packing problems and Scheduling problems.
Algorithms for packing and scheduling problems / Michele, Monaci. - In: 4OR. - ISSN 1619-4500. - STAMPA. - 1:(2004), pp. 85-87. [10.1007/s10288-002-0011-1]
Algorithms for packing and scheduling problems
MONACI, MICHELE
2004
Abstract
We survey the main results presented in the author’s Ph.D Thesis (Monaci 2001), discussed on January 2002 at the University of Bologna (Italy) and supervised by Paolo Toth and Silvano Martello. The thesis deals with exact and heuristic approaches for solving a class of combinatorial optimization problems, with particular emphasis on Two-Dimensional Packing problems and Scheduling problems.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
