AAAAAA

   
Results: 1-15 |
Results: 15
STEVIOSIDE CONTENT AND MORPHOLOGICAL VARIABILITY IN A POPULATION OF STEVIA-REBAUDIANA (BERTONI) BERTONI FROM PARAGUAY
Authors: TATEO F MARIOTTI M BONONI M LUBIAN E MARTELLO S CORNARA L
Citation: F. Tateo et al., STEVIOSIDE CONTENT AND MORPHOLOGICAL VARIABILITY IN A POPULATION OF STEVIA-REBAUDIANA (BERTONI) BERTONI FROM PARAGUAY, Italian journal of food sciences, 10(3), 1998, pp. 261-267
ON TIGHTENING 0-1-PROGRAMS BASED ON EXTENSIONS OF PURE 0-1-KNAPSACK AND SUBSET-SUM PROBLEMS
Authors: ESCUDERO LF MARTELLO S TOTH P
Citation: Lf. Escudero et al., ON TIGHTENING 0-1-PROGRAMS BASED ON EXTENSIONS OF PURE 0-1-KNAPSACK AND SUBSET-SUM PROBLEMS, Annals of operation research, 81, 1998, pp. 379-404
EXACT SOLUTION OF THE 2-DIMENSIONAL FINITE BIN PACKING PROBLEM
Authors: MARTELLO S VIGO D
Citation: S. Martello et D. Vigo, EXACT SOLUTION OF THE 2-DIMENSIONAL FINITE BIN PACKING PROBLEM, Management science, 44(3), 1998, pp. 388-399
THE K-CARDINALITY ASSIGNMENT PROBLEM
Authors: DELLAMICO M MARTELLO S
Citation: M. Dellamico et S. Martello, THE K-CARDINALITY ASSIGNMENT PROBLEM, Discrete applied mathematics, 76(1-3), 1997, pp. 103-121
EXACT AND APPROXIMATION ALGORITHMS FOR MAKESPAN MINIMIZATION ON UNRELATED PARALLEL MACHINES
Authors: MARTELLO S SOUMIS F TOTH P
Citation: S. Martello et al., EXACT AND APPROXIMATION ALGORITHMS FOR MAKESPAN MINIMIZATION ON UNRELATED PARALLEL MACHINES, Discrete applied mathematics, 75(2), 1997, pp. 169-188
UPPER-BOUNDS AND ALGORITHMS FOR HARD 0-1-KNAPSACK-PROBLEMS
Authors: MARTELLO S TOTH P
Citation: S. Martello et P. Toth, UPPER-BOUNDS AND ALGORITHMS FOR HARD 0-1-KNAPSACK-PROBLEMS, Operations research, 45(5), 1997, pp. 768-778
OPEN SHOP, SATELLITE COMMUNICATION AND A THEOREM BY EGERVARY (1931)
Authors: DELLAMICO M MARTELLO S
Citation: M. Dellamico et S. Martello, OPEN SHOP, SATELLITE COMMUNICATION AND A THEOREM BY EGERVARY (1931), Operations research letters, 18(5), 1996, pp. 207-211
MINIMIZING THE SUM OF WEIGHTED COMPLETION TIMES WITH UNRESTRICTED WEIGHTS
Authors: DELLAMICO M MARTELLO S VIGO D
Citation: M. Dellamico et al., MINIMIZING THE SUM OF WEIGHTED COMPLETION TIMES WITH UNRESTRICTED WEIGHTS, Discrete applied mathematics, 63(1), 1995, pp. 25-41
THE BOTTLENECK GENERALIZED ASSIGNMENT PROBLEM
Authors: MARTELLO S TOTH P
Citation: S. Martello et P. Toth, THE BOTTLENECK GENERALIZED ASSIGNMENT PROBLEM, European journal of operational research, 83(3), 1995, pp. 621-638
A NOTE ON EXACT ALGORITHMS FOR THE BOTTLENECK GENERALIZED ASSIGNMENT PROBLEM
Authors: MARTELLO S TOTH P
Citation: S. Martello et P. Toth, A NOTE ON EXACT ALGORITHMS FOR THE BOTTLENECK GENERALIZED ASSIGNMENT PROBLEM, European journal of operational research, 83(3), 1995, pp. 711-712
AN EXACT ALGORITHM FOR THE DUAL BIN PACKING PROBLEM
Authors: LABBE M LAPORTE G MARTELLO S
Citation: M. Labbe et al., AN EXACT ALGORITHM FOR THE DUAL BIN PACKING PROBLEM, Operations research letters, 17(1), 1995, pp. 9-18
SPECIAL ISSUE OF INFOR ON KNAPSACK, PACKING AND CUTTING
Authors: MARTELLO S
Citation: S. Martello, SPECIAL ISSUE OF INFOR ON KNAPSACK, PACKING AND CUTTING, INFOR. Information systems and operational research, 32(4), 1994, pp. 217-218
SPECIAL ISSUE OF INFOR ON KNAPSACK, PACKING AND CUTTING
Authors: MARTELLO S
Citation: S. Martello, SPECIAL ISSUE OF INFOR ON KNAPSACK, PACKING AND CUTTING, INFOR. Information systems and operational research, 32(3), 1994, pp. 121-123
ALGORITHMS FOR MINIMIZING MAXIMUM LATENESS WITH UNIT LENGTH TASKS ANDRESOURCE CONSTRAINTS
Authors: BLAZEWICZ J KUBIAK W MARTELLO S
Citation: J. Blazewicz et al., ALGORITHMS FOR MINIMIZING MAXIMUM LATENESS WITH UNIT LENGTH TASKS ANDRESOURCE CONSTRAINTS, Discrete applied mathematics, 42(2-3), 1993, pp. 123-138
THE DELIVERY MAN PROBLEM AND CUMULATIVE MATROIDS
Authors: FISCHETTI M LAPORTE G MARTELLO S
Citation: M. Fischetti et al., THE DELIVERY MAN PROBLEM AND CUMULATIVE MATROIDS, Operations research, 41(6), 1993, pp. 1055-1064
Risultati: 1-15 |