Algorithms for packing and scheduling problems


Wesurvey themain results presented in the author’sPh.DThesis (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… (More)
DOI: 10.1007/s10288-002-0011-1

Cite this paper

@article{Monaci2003AlgorithmsFP, title={Algorithms for packing and scheduling problems}, author={Michele Monaci}, journal={4OR}, year={2003}, volume={1}, pages={85-87} }