Login / Signup
A polyhedral study on 0-1 knapsack problems with disjoint cardinality constraints: Facet-defining inequalities by sequential lifting.
Bo Zeng
Jean-Philippe P. Richard
Published in:
Discret. Optim. (2011)
Keyphrases
</>
knapsack problem
cardinality constraints
database
database design
entity relationship