Martello Silvano

Silvano Martello

Information about the author Silvano Martello will soon be added to the site.
Found 38 papers in total
Efficient Two‐Dimensional Packing Algorithms for Mobile WiMAX
Efficient Two‐Dimensional Packing Algorithms for Mobile WiMAX
2011
We present the result of research, developed within Nokia Siemens Networks, to solve...
A note on exact and heuristic algorithms for the identical parallel machine scheduling problem
A note on exact and heuristic algorithms for the identical parallel machine scheduling problem
2012
A recent paper (Davidović et al., J. Heuristics, 18:549–569, 2012)...
Models and algorithms for fair layout optimization problems
Models and algorithms for fair layout optimization problems
2010
Given a non-convex two-dimensional area and identical rectangular stands, we consider...
Routing problems with loading constraints
Routing problems with loading constraints
2010
We consider difficult combinatorial optimization problems arising in transportation...
Jenõ Egerváry: from the origins of the Hungarian algorithm to satellite communication
Jenõ Egerváry: from the origins of the Hungarian algorithm to satellite communication
2010
We discuss some relevant results obtained by Egerváry in the early Thirties,...
Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem
Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem
2008
Given a set of jobs with associated processing times, and a set of identical machines,...
Packing into the smallest square: Worst-case analysis of lower bounds
Packing into the smallest square: Worst-case analysis of lower bounds
2006
We address the problem of packing a given set of rectangles into the minimum size...
Lower bounds and heuristic algorithms for the ki-partitioning problem
Lower bounds and heuristic algorithms for the ki-partitioning problem
2006
We consider the problem of partitioning a set of positive integers values into a given...
An exact approach to the Strip-Packing problem
An exact approach to the Strip-Packing problem
2003
We consider the problem of orthogonally packing a given set of rectangular items into...
A note on exact algorithms for the identical parallel machine scheduling problem
A note on exact algorithms for the identical parallel machine scheduling problem
2005
A recently published paper by Mokotoff presents an exact algorithm for the classical...
TSpack: A unified tabu search code for multi-dimensional bin packing problems
TSpack: A unified tabu search code for multi-dimensional bin packing problems
2004
We present a computer code that implements a general Tabu Search technique for the...
Models and bounds for two-dimensional level packing problems
Models and bounds for two-dimensional level packing problems
2004
We consider two-dimensional bin packing and strip packing problems where the items...
Heuristic algorithms and scatter search for the cardinality constrained P/Cmax problem
Heuristic algorithms and scatter search for the cardinality constrained P/Cmax problem
2004
We consider the generalization of the classical P /C max problem (assign to n jobs to...
Upper bounds and algorithms for the maximum cardinality bin packing problem
Upper bounds and algorithms for the maximum cardinality bin packing problem
2003
In the maximum cardinality bin packing problem, we are given m bins of capacity c and...
An exact algorithm for the two-constraint 0–1 knapsack problem
An exact algorithm for the two-constraint 0–1 knapsack problem
2003
We consider a knapsack problem in which each item has two types of weight and the...
A polyhedral approach to simplified crew scheduling and vehicle scheduling problems
A polyhedral approach to simplified crew scheduling and vehicle scheduling problems
2001
Crew and vehicle scheduling are fundamental issues in public transit management....
Two-dimensional packing problems: A survey
Two-dimensional packing problems: A survey
2002
We consider problems requiring to allocate a set of rectangular items to larger...
Heuristic algorithms for the three-dimensional bin packing problem
Heuristic algorithms for the three-dimensional bin packing problem
2002
The Three-dimensional Bin Packing Problem (3BP) consists of allocating, without...
Bounds for the cardinality constrained P‖Cmax problem
Bounds for the cardinality constrained P‖Cmax problem
2001
We consider the generalization of the classical P ‖ C max problem arising when...
Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems
Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems
1999
Two-dimensional bin packing problems consist of allocating, without overlapping, a...
The three-dimensional bin packing problem
The three-dimensional bin packing problem
2000
The problem addressed in this paper is that of orthogonally packing a given set of...
New trends in exact algorithms for the 0–1 knapsack problem
New trends in exact algorithms for the 0–1 knapsack problem
2000
While the 1980s were focused on the solution of large sized ‘easy’...
Upper bounds and algorithms for hard 0–1 knapsack problems
Upper bounds and algorithms for hard 0–1 knapsack problems
1997
It is well-known that many instances of the 0–1 knapsack problem can be...
Dynamic programming and strong bounds for the 0–1 knapsack problem
Dynamic programming and strong bounds for the 0–1 knapsack problem
1999
Two new algorithms recently proved to outperform all previous methods for the exact...
Papers per page: