Martello Silvano

Silvano Martello

Information about the author Silvano Martello will soon be added to the site.
Found 38 papers in total
Approximation algorithms for the oriented two-dimensional bin packing problem
Approximation algorithms for the oriented two-dimensional bin packing problem
1999
Given a set of rectangular items which may not be rotated and an unlimited number of...
Exact solution of the Two-Dimensional Finite Bin Packing Problem
Exact solution of the Two-Dimensional Finite Bin Packing Problem
1998
Given a set of rectangular pieces to be cut from an unlimited number of standardized...
Optimal scheduling of tasks on identical parallel processors
Optimal scheduling of tasks on identical parallel processors
1995
We consider the classical problem of scheduling n tasks with given processing time on...
The bottleneck generalized assignment problem
The bottleneck generalized assignment problem
1995
The min–max version of the generalized assignment problem is considered. We...
A note on exact algorithms for the bottleneck generalized assignment problem
A note on exact algorithms for the bottleneck generalized assignment problem
1995
We give a computational comparison between the algorithms of Mazzola–Neebe and...
Open shop, satellite communication and a theorem by Egerváry (1931)
Open shop, satellite communication and a theorem by Egerváry (1931)
1996
The authors consider a combinatorial optimization problem arising, in different forms,...
An exact algorithm for the dual bin packing problem
An exact algorithm for the dual bin packing problem
1995
In the Dual Bin Packing Problem (DBP), there is an unlimited number of bins of...
The delivery man problem and cumulative matroids
The delivery man problem and cumulative matroids
1993
Given a complete directed graph G=(V,A), the delivery man problem (DMP) consists of...
Approximation algorithms for fixed job schedule problems
Approximation algorithms for fixed job schedule problems
1992
The authors consider two generalizations of the fixed job schedule problem, obtained...
An exact algorithm for large unbounded knapsack problems
An exact algorithm for large unbounded knapsack problems
1990
Given n item types, each having an associated profit and weight, and a container of...
Problems of ‘Bus Driver Scheduling’ and ‘Vehicle Scheduling’
Problems of ‘Bus Driver Scheduling’ and ‘Vehicle Scheduling’
1988
Problems of ‘Bus Driver Scheduling’ and ‘Vehicle Scheduling’...
The fixed job schedule problem with working-time constraints
The fixed job schedule problem with working-time constraints
1989
The authors consider a generalization of the fixed job schedule problem where a bound...
Algorithms and codes for the Assignment Problem
Algorithms and codes for the Assignment Problem
1988
This paper analyzes the most efficient algorithms for the Linear Min-Sum Assignment...
A hybrid algorithm for finding the kth smallest of n elements in O(n) time
A hybrid algorithm for finding the kth smallest of n elements in O(n) time
1988
The problem of finding the k th smallest of n elements can be solved either with O( n...
Papers per page: