# S. Martello

Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Knapsack Problems: Algorithms and Computer Implementations

- S. Martello, P. Toth
- Computer Science
- 1 November 1990

Introduction knapsack problem bounded knapsack problem subset-sum problem change-making problem multiple knapsack problem generalized assignment problem bin packing problem. Appendix: computer codes.

Decision Making under Uncertainty in Electricity Markets

- S. Martello
- Economics, Computer Science
- J. Oper. Res. Soc.
- 1 January 2015

In the electricity market, many decisions to be taken by market agents involve considerable data uncertainty, and stochastic programming is a useful tool for defining mathematical models to obtain… Expand

The Three-Dimensional Bin Packing Problem

- S. Martello, David Pisinger, D. Vigo
- Computer Science, Mathematics
- Oper. Res.
- 15 March 2000

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… Expand

Exact Solution of the Two-Dimensional Finite Bon Packing Problem

- S. Martello, D. Vigo
- Mathematics
- 1 March 1998

Given a set of rectangular pieces to be cut from an unlimited number of standardized stock pieces (bins), the Two-Dimensional Finite Bin Packing Problem is to determine the minimum number of stock… Expand

Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems

- A. Lodi, S. Martello, D. Vigo
- Mathematics, Computer Science
- INFORMS J. Comput.
- 1 April 1999

Two-dimensional bin packing problems consist of allocating, without overlapping, a given set of small rectangles (items) to a minimum number of large identical rectangles (bins), with the edges of… Expand

Two-dimensional packing problems: A survey

- A. Lodi, S. Martello, Michele Monaci
- Mathematics, Computer Science
- Eur. J. Oper. Res.
- 1 September 2002

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… Expand

A Tabu Search Algorithm for a Routing and Container Loading Problem

- M. Gendreau, M. Iori, G. Laporte, S. Martello
- Computer Science, Mathematics
- Transp. Sci.
- 1 August 2006

This article considers a combination of capacitated vehicle routing and three-dimensional loading, with additional constraints frequently encountered in freight transportation. It proposes a tabu… Expand

Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem

- S. Martello, David Pisinger, P. Toth
- Mathematics
- 1 March 1999

Two new algorithms recently proved to outperform all previous methods for the exact solution of the 0-1 Knapsack Problem. This paper presents a combination of such approaches, where, in additi on,… Expand

Lower bounds and reduction procedures for the bin packing problem

- S. Martello, P. Toth
- Mathematics, Computer Science
- Discret. Appl. Math.
- 1 July 1990

The bin packing problem, in which a set of items of various sizes has to be packed into a minimum number of identical bins, has been extensively studied during the past fifteen years, mainly with the… Expand

An Exact Approach to the Strip-Packing Problem

- S. Martello, Michele Monaci, D. Vigo
- Mathematics, Computer Science
- INFORMS J. Comput.
- 15 July 2003

We consider the problem of orthogonally packing a given set of rectangular items into a given strip, by minimizing the overall height of the packing. The problem is NP-hard in the strong sense, and… Expand