Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
Year of publication: |
1997
|
---|---|
Authors: | Martello, Silvano ; Toth, Paolo |
Published in: |
Operations research : the journal of the Operations Research Society of America. - Linthicum, Md : INFORMS, ISSN 0030-364X, ZDB-ID 1233890. - Vol. 45.1997, 5, p. 768-778
|
Saved in:
Saved in favorites
Similar items by person
-
An Exact Algorithm for the Two-Constraint 0-1 Knapsack Problem
Martello, Silvano, (2003)
-
A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems
Fischetti, Matteo, (2001)
-
Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
Martello, Silvano, (1999)
- More ...