Models and bounds for two-dimensional level packing problems (2008)
Andrea Lodi, Silvano Martello, Daniele Vigo
We consider two-dimensional bin packing and strip packing problems where the items have to be packed by levels. We introduce new mathematical models involving a polynomial number of variables and...
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...
Algorithms for Two-Dimensional Bin Packing and Assignment Problems (2008)
Ingegneria Dei Sistemi, Xii Ciclo, Andrea Lodi, Il Coordinatore, I Tutori, Prof Giovanni, ...
Acknowledgments v List of figures viii List of tables xi
A Note on Exact Algorithms for the Identical Parallel Machine Scheduling Problem (2008)
A recently published paper by E. Mokotoff presents an exact algorithm for the classical P ||Cmax scheduling problem, evaluating its average performance through computational experiments on a series...
DOI: 10.1007/s10288-006-0088-z 4OR: Year 4 (2008)
Denis Bouyssou, Silvano Martello, Frank Plastria
Three years ago, we were writing in the editorial notes inserted in the first issue of this journal (see Bouyssou et al. 2003) that “Starting a new journal is a challenge”. It was. But three...
2 Università di Bologna (2008)
Denis Bouyssou, Silvano Martello, Frank Plastria, D. Bouyssou, S. Martello, F. Plastria
Three years ago, we were writing in the editorial notes inserted in the first issue of this journal (see Bouyssou et al., 2003) that “Starting a new journal is a challenge”. It was. But three...
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...
2 Università di Bologna (2006)
Denis Bouyssou, Silvano Martello
Three years ago, we were writing in the editorial notes inserted in the first issue of this journal (see Bouyssou et al., 2003) that “Starting a new journal is a challenge”. It was. But three...
A note on exact algorithms for the identical parallel machine scheduling problem (2005)
Dell’Amico, Mauro, Martello, Silvano
A recently published paper by Mokotoff presents an exact algorithm for the classical P//Cmax scheduling problem, evaluating its average performance through computational experiments on a series of...
TSpack: a unified tabu search code for multi-dimensional bin packing problems (2004)
Lodi, Andrea, Martello, Silvano, Vigo, Daniele
We present a computer code that implements a general Tabu Search technique for the solution of two- and three-dimensional bin packing problems, as well as virtually any of their variants requiring...
Models and bounds for two-dimensional level packing problems (2004)
Lodi, Andrea, Martello, Silvano, Vigo, Daniele
We consider two-dimensional bin packing and strip packing problems where the items have to be packed by levels. We introduce new mathematical models involving a polynomial number of variables and...
Heuristic algorithms and scatter search for the cardinality constrained P//Cmax problem (2004)
Dell’Amico, Mauro, Iori, Manuel, Martello, Silvano
We consider the generalization of the classical P//Cmax problem (assign n jobs to m identical parallel processors by minimizing the makespan) arising when the number of jobs that can be assigned to...
The Three-Dimensional Bin Packing Problem (2000)
Silvano Martello, David Pisinger, Daniele Vigo
The problem addressed in this paper is that of orthogonally packing a given set of rectangular-shaped boxes into the minimum number of rectangular bins. The problem is strongly NP-hard and extremely...
The Three-Dimensional Bin Packing Problem (2000)
Silvano Martello, David Pisinger, Daniele Vigo
The problem addressed in this paper is that of orthogonally packing a given set of rectangular-shaped boxes into the minimum number of rectangular bins. The problem is strongly NP-hard and extremely...
The Three-Dimensional Bin Packing Problem (2000)
Silvano Martello, David Pisinger, Daniele Vigo
The problem addressed in this paper is that of orthogonally packing a given set of rectangular-shaped items into the minimum number of three-dimensional rectangular bins. The problem is strongly...
Efficient Algorithms and Codes for k-Cardinality Assignment Problems (1998)
Mauro Dell'amico, Andrea Lodi, Silvano Martello
Given a cost matrix W and a positive integer k, the k-cardinality assignment problem is to assign k rows to k columns so that the sum of the corresponding costs is a minimum. This generalization of...
Lower bounds and heuristic algorithms for the ki-partitioning problem
Dell'Amico, Mauro, Iori, Manuel, Martello, Silvano, Monaci, Michele