Martello S.

S. Martello

Information about the author S. Martello will soon be added to the site.
Found 3 papers in total
On tightening 0–1 programs based on extensions of pure 0–1 knapsack and subset-sum problems
On tightening 0–1 programs based on extensions of pure 0–1 knapsack and subset-sum problems
1998
We present a framework for automatic tightening of general 0–1 programs. A given...
Algorithms for minimizing maximum lateness with unit length tasks and resource constraints
Algorithms for minimizing maximum lateness with unit length tasks and resource constraints
1993
The problem the authors consider is that of scheduling n unit length tasks on...
Surveys in Combinatorial Optimization
Surveys in Combinatorial Optimization
1987
What is nowadays referred to as ‘Combinatorial Optimization, derives from the...
Papers per page: