Author of the publication

Exact and heuristic algorithms for the interval min-max regret generalized assignment problem.

, , , and . Computers & Industrial Engineering, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Martello, Silvano
add a person with the name Martello, Silvano
 

Other publications of authors with the same name

Complexity and approximation of an area packing problem., , , , and . Optimization Letters, 6 (1): 1-9 (2012)An Exact Algorithm for the Two-Constraint 0 - 1 Knapsack Problem., and . Operations Research, 51 (5): 826-835 (2003)The Fixed Job Schedule Problem with Working-Time Constraints., , and . Operations Research, 37 (3): 395-403 (1989)The Fixed Job Schedule Problem with Spread-Time Constraints., , and . Operations Research, 35 (6): 849-858 (1987)Algorithms for the min-max regret generalized assignment problem with interval data., , , and . IEEM, page 734-738. IEEE, (2014)A note on exact algorithms for the identical parallel machine scheduling problem., and . European Journal of Operational Research, 160 (2): 576-578 (2005)Two-dimensional packing problems: A survey., , and . European Journal of Operational Research, 141 (2): 241-252 (2002)Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||Cmax Problem., , and . J. Heuristics, 10 (2): 169-204 (2004)Algorithm 37 Algorithm for the solution of the 0-1 single knapsack problem., and . Computing, 21 (1): 81-86 (1978)Heuristic algorithms for the general nonlinear separable knapsack problem., and . Computers & OR, 38 (2): 505-513 (2011)