-algorithm for LP-knapsacks with a fixed number of GUB constraints.
Peter BruckerPublished in: Z. Oper. Research (1984)
Keyphrases
- fixed number
- linear programming
- optimal solution
- computational complexity
- learning algorithm
- worst case
- dynamic programming
- preprocessing
- experimental evaluation
- high accuracy
- matching algorithm
- k means
- computational cost
- genetic algorithm
- similarity measure
- geometric constraints
- constraint sets
- search space
- finite number
- recognition algorithm
- knapsack problem
- convex hull
- segmentation algorithm
- graph cuts
- expectation maximization
- objective function
- significant improvement