Login / Signup
A polyhedral study on 0-1 knapsack problems with disjoint cardinality constraints: Strong valid inequalities by sequence-independent lifting.
Bo Zeng
Jean-Philippe P. Richard
Published in:
Discret. Optim. (2011)
Keyphrases
</>
knapsack problem
linear programming relaxation
valid inequalities
cardinality constraints
convex hull
cutting plane
integer programming
traveling salesman problem
genetic algorithm
special case
lower and upper bounds