论文信息 - Algorithms for packing and scheduling problems

Algorithms for packing and scheduling problems

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.

Michele Monaci | M. Monaci

[1] Manuel Iori,et al. Metaheuristic Algorithms for the Strip Packing Problem , 2003 .

[2] Andrea Lodi,et al. Two-dimensional packing problems: A survey , 2002, Eur. J. Oper. Res..

[3] Matteo Fischetti,et al. Solution of real-world train timetabling problems , 2001, Proceedings of the 34th Annual Hawaii International Conference on System Sciences.

[4] Alberto Caprara,et al. An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem , 2002, IPCO.

[5] Andrea Lodi,et al. Integer linear programming models for 2-staged two-dimensional Knapsack problems , 2003, Math. Program..

[6] Paolo Toth,et al. A Global Method for Crew Planning in Railway Applications , 2001 .

[7] Daniele Vigo,et al. An Exact Approach to the Strip-Packing Problem , 2003, INFORMS J. Comput..