Login / Signup
On tightening 0-1 programs based on extensions ofpure 0-1 knapsack and subset-sum problems.
Laureano F. Escudero
Silvano Martello
Paolo Toth
Published in:
Ann. Oper. Res. (1998)
Keyphrases
</>
artificial intelligence
application domains
problems involving
real time
genetic algorithm
optimization problems
knapsack problem
database
data sets
learning algorithm
lower bound
search space
source code
benchmark problems
computer programs
min sum