We survey the main result 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

MONACI, MICHELE
2003

Abstract

We survey the main result 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.
2003
4OR
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11577/1479291
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 8
  • ???jsp.display-item.citation.isi??? 4
social impact