Supermodular covering knapsack polytope.
Alper AtamtürkAvinash BhardwajPublished in: Discret. Optim. (2015)
Keyphrases
- knapsack problem
- lattice points
- optimal solution
- stable set
- optimization problems
- dynamic programming
- upper bound
- combinatorial optimization
- np hard
- convex hull
- directed graph
- special case
- search algorithm
- real world
- greedy algorithm
- data structure
- geometric properties
- cutting plane
- semidefinite
- extreme points
- bayesian networks
- minimum volume
- artificial intelligence