Silvano Martello
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Silvano Martello has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
Paolo Toth
University of Bologna, Italy
4 shared publications- Andrea Lodi
University of Bologna
3 shared publications - Daniele Vigo
University of Bologna
3 shared publications - Manuel Iori
DISMI University of Modena and Reggio Emilia Reggio Emilia Italy
2 shared publications - Alberto Borghetti
University of Bologna
1 shared publication - Alessandro Trebbi
Direzione Operation Italia - Settlement
1 shared publication
Latest Publications
- 21 July 2006
- Published by Springer Nature in 4OR
- Vol. 5 (3) , 247-259
An optimization problem in the electricity market
- 21 July 2006
- Published by Springer Nature in 4OR
- Vol. 5 (3) , 247-259
An optimization problem in the electricity market
- 1 October 2004
- Published by Springer Nature in Annals of Operations Research
- Vol. 131 (1-4) , 203-213
TSpack: A Unified Tabu Search Code for Multi-Dimensional Bin Packing Problems
- 1 October 2004
- Published by Springer Nature in Annals of Operations Research
- Vol. 131 (1-4) , 203-213
TSpack: A Unified Tabu Search Code for Multi-Dimensional Bin Packing Problems
- 1 September 2004
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 8 (3) , 363-379
Models and Bounds for Two-Dimensional Level Packing Problems
- 1 September 2004
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 8 (3) , 363-379
Models and Bounds for Two-Dimensional Level Packing Problems
- 1 March 2004
- Published by Springer Nature in Journal of Heuristics
- Vol. 10 (2) , 169-204
Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||Cmax Problem
- 1 March 2004
- Published by Springer Nature in Journal of Heuristics
- Vol. 10 (2) , 169-204
Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||Cmax Problem
- 1 January 2003
- Published by Springer Nature
- p. 159-179
Metaheuristic Algorithms for the Strip Packing Problem
- 1 January 2003
- Published by Springer Nature
- p. 159-179
Metaheuristic Algorithms for the Strip Packing Problem
- 1 January 1999
- Published by Springer Nature
- p. 125-139
Neighborhood Search Algorithm for the Guillotine Non-Oriented Two-Dimensional Bin Packing Problem
- 1 January 1999
- Published by Springer Nature
- p. 125-139
Neighborhood Search Algorithm for the Guillotine Non-Oriented Two-Dimensional Bin Packing Problem
- 1 October 1997
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 45 (5) , 768-778
Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
It is well-known that many instances of the 0-1 knapsack problem can be effectively solved to optimality also for very large values of n (the number of binary variables), while other instances cannot be solved for n equal to only a few hundreds. We propose upper bounds obtained from the mathematical model of the problem by adding valid inequalities on the cardinality of an optimal solution, and relaxing it in a Lagrangian fashion. We then introduce a specialized iterative technique for determining the optimal Lagrangian multipliers in polynomial time. A branch-and-bound algorithm is finally developed. Computational experiments prove that several classes of hard instances are effectively solved even for large values of n.
- 1 October 1997
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 45 (5) , 768-778
Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
It is well-known that many instances of the 0-1 knapsack problem can be effectively solved to optimality also for very large values of n (the number of binary variables), while other instances cannot be solved for n equal to only a few hundreds. We propose upper bounds obtained from the mathematical model of the problem by adding valid inequalities on the cardinality of an optimal solution, and relaxing it in a Lagrangian fashion. We then introduce a specialized iterative technique for determining the optimal Lagrangian multipliers in polynomial time. A branch-and-bound algorithm is finally developed. Computational experiments prove that several classes of hard instances are effectively solved even for large values of n.
- 1 June 1991
- Published by JSTOR in Journal of the Operational Research Society
- Vol. 42 (6) , 513
Knapsack Problems: Algorithms and Computer Implementations
- 1 June 1991
- Published by JSTOR in Journal of the Operational Research Society
- Vol. 42 (6) , 513
Knapsack Problems: Algorithms and Computer Implementations
- 1 June 1984
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 30 (6) , 765-771
A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
Given n items, each having a weight w i, and a container of capacity W, the Subset-Sum Problem (SSP) is to select a subset of the items whose total weight is closest to, without exceeding, W. The paper presents a mixed approach (depth first search-dynamic programming) to the exact solution of the problem. An extensive computational experience is presented, comparing the proposed algorithm with that of Ahrens-Finke, as well as with the Balas-Zemel algorithm for large problems. Both "easy" and "hard" problems with values of n up to 10,000 are considered.programming: integer algorithms, branch and bound/dynamic programming
- 1 June 1984
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 30 (6) , 765-771
A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
Given n items, each having a weight w i, and a container of capacity W, the Subset-Sum Problem (SSP) is to select a subset of the items whose total weight is closest to, without exceeding, W. The paper presents a mixed approach (depth first search-dynamic programming) to the exact solution of the problem. An extensive computational experience is presented, comparing the proposed algorithm with that of Ahrens-Finke, as well as with the Balas-Zemel algorithm for large problems. Both "easy" and "hard" problems with values of n up to 10,000 are considered.programming: integer algorithms, branch and bound/dynamic programming
- 1 April 1984
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 32 (2) , 380-389
An Algorithm for the Bottleneck Traveling Salesman Problem
Given a graph with arc costs, the Bottleneck Traveling Salesman Problem is to find a Hamiltonian circuit that minimizes the largest cost of any of its arcs. Lower bounds for the problem (bottleneck assignment problem, bottleneck paths, bottleneck arborescence, cuts) are analyzed and combined to obtain a bounding procedure for a breadth-first branch and bound algorithm. At each node of the branch-decision tree, the algorithm uses a heuristic search to find a Hamiltonian circuit containing only arcs whose cost is not greater than the current lower bound, the aim being to reduce the number of nodes explored. Extensive computational results are discussed. These show that, unlike the classical Traveling Salesman Problem, the same algorithm can be used successfully for large numbers of vertices both in symmetric and in asymmetric cases. Results for Euclidean graphs are also presented.
- 1 April 1984
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 32 (2) , 380-389
An Algorithm for the Bottleneck Traveling Salesman Problem
Given a graph with arc costs, the Bottleneck Traveling Salesman Problem is to find a Hamiltonian circuit that minimizes the largest cost of any of its arcs. Lower bounds for the problem (bottleneck assignment problem, bottleneck paths, bottleneck arborescence, cuts) are analyzed and combined to obtain a bounding procedure for a breadth-first branch and bound algorithm. At each node of the branch-decision tree, the algorithm uses a heuristic search to find a Hamiltonian circuit containing only arcs whose cost is not greater than the current lower bound, the aim being to reduce the number of nodes explored. Extensive computational results are discussed. These show that, unlike the classical Traveling Salesman Problem, the same algorithm can be used successfully for large numbers of vertices both in symmetric and in asymmetric cases. Results for Euclidean graphs are also presented.