Lifted cover facets of the 0-1 knapsack polytope with GUB constraints.

George L. Nemhauser Pamela H. Vance

Published in: Oper. Res. Lett. (1994)

Keyphrases

knapsack problem
facet defining inequalities
probabilistic inference
constraint satisfaction
dynamic programming
cover inequalities
convex hull
directed graph
stable set
case study
upper bound
special case
bayesian networks
geometric constraints
packing problem
linear constraints
subtour elimination
database