Algorithms for packing and scheduling problems

@article{Monaci2003AlgorithmsFP,
  title={Algorithms for packing and scheduling problems},
  author={Michele Monaci},
  journal={4OR},
  year={2003},
  volume={1},
  pages={85-87}
}
We survey the main results presented in the author’s Ph.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 problems and Scheduling problems. 

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
23 Extracted Citations
9 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 23 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-9 of 9 references

AnApproximation Scheme for the Two - Stage , Two - Dimensional Bin Packing Problem

  • Wilson NHM
  • Lecture Notes in Economics and Mathematical…
  • 2002

MetaheuristicAlgorithms for the Strip Packing Problem. In: Pardalos P, Korotkich V (eds) Optimization and Industry: New Frontieres

  • M Iori, S Martello, M Monaci
  • 2002
2 Excerpts

Algorithms for Packing and Scheduling Problems

  • M Monaci
  • PhD thesis,
  • 2001
1 Excerpt

Similar Papers

Loading similar papers…