Abstract Invited Review Two-dimensional packing problems: A survey (2008)
Andrea Lodi, Silvano Martello, Michele Monaci
We consider problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste. In two-dimensional bin packing problems these units are finite...
Lower bounds and heuristic algorithms for the ki-partitioning problem (2006)
Dell’Amico, Mauro, Iori, Manuel, Martello, Silvano, Monaci, Michele
We consider the problem of partitioning a set of positive integers values into a given number of subsets, each having an associated cardinality limit, so that the maximum sum of values in a subset is...
How tight is the corner relaxation? (2005)
Matteo Fischetti, Michele Monaci
Given a mixed-integer linear programming (MILP) model and an optimal basis of the associated linear programming relaxation, the Gomory’s corner relaxation is obtained by dropping nonnegativity...
A Heuristic Algorithm for Trip Aggregation in Vehicle Routing Applications (2003)
In this paper we consider a generalization of the classical Vechicle Routing Problem (VRP) where the objective is to determine the daily assignment for each vehicle, possibly made up by more than one...
A global method for crew planning in railway applications (2001)
Alberto Caprara, Michele Monaci, Paolo Toth
Abstract. Crew planning is a typical problem arising in the management of large transit systems (such as railway and airline companies). Given a set of train services to be performed every day, the...
Solution of real-world train timetabling problems (2001)
Alberto Caprara, Michele Monaci, Paolo Toth, Matteo Fischetti, Pier Luigi Guida
The Train Timetabling Problem (TTP) aims at determining a timetable for a set of trains which does not violate track capacities and satises some operational constraints. We concentrate on the problem...