Group Theoretic Algorithms for the Integer Programming Problem II: Extension to a General Algorithm.
Jeremy F. ShapiroPublished in: Oper. Res. (1968)
Keyphrases
- integer programming
- learning algorithm
- worst case
- computational complexity
- np hard
- benchmark problems
- set covering
- cutting plane
- search space
- running times
- optimal solution
- exact algorithms
- special case
- lagrangian relaxation
- network flow
- knapsack problem
- dynamic programming
- factor graphs
- inference problems
- cutting plane algorithm