Silvano Martello

21 catalog papers. Identity-linked publications and additional name matches are distinguished below.

ORCID: 0000-0001-6515-1406

Publications

• An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion — INFORMS Journal on Computing 2022
• Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem — INFORMS Journal on Computing 2015
• Efficient Two-Dimensional Packing Algorithms for Mobile WiMAX — Management Science 2011
• Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem — INFORMS Journal on Computing 2008
• Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems — Operations Research 2005
• An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem — Operations Research 2003
• An Exact Approach to the Strip-Packing Problem — INFORMS Journal on Computing 2003
• A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems — Management Science 2001
• The Three-Dimensional Bin Packing Problem — Operations Research 2000
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems — INFORMS Journal on Computing 1999
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem — Management Science 1999
• Exact Solution of the Two-Dimensional Finite Bin Packing Problem — Management Science 1998
• Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems — Operations Research 1997
• Optimal Scheduling of Tasks on Identical Parallel Processors — ORSA Journal on Computing 1995
• The Delivery Man Problem and Cumulative Matroids — Operations Research 1993
• The Fixed Job Schedule Problem with Working-Time Constraints — Operations Research 1989
• A New Algorithm for the 0-1 Knapsack Problem — Management Science 1988
• The Fixed Job Schedule Problem with Spread-Time Constraints — Operations Research 1987
• A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem — Management Science 1984
• An Algorithm for the Bottleneck Traveling Salesman Problem — Operations Research 1984
• Technical Note—A Note on the Ingargiola-Korsh Algorithm for One-Dimensional Knapsack Problems — Operations Research 1980