The vertices of the knapsack polytope.
A. C. HayesDavid G. LarmanPublished in: Discret. Appl. Math. (1983)
Keyphrases
- knapsack problem
- hamiltonian cycle
- dynamic programming
- lattice points
- convex hull
- optimal solution
- stable set
- weighted graph
- upper bound
- traveling salesman problem
- feasible solution
- np hard
- optimization problems
- minimum weight
- greedy heuristic
- data sets
- facet defining inequalities
- edge weights
- directed graph
- information retrieval
- multiple choice
- semidefinite
- phase transition
- real time
- directed edges