Remark on algorithm 341 [H]: solution of linear programs in 0-1 variables by implicit enumeration.
Les G. ProllPublished in: Commun. ACM (1969)
Keyphrases
- implicit enumeration
- optimal solution
- linear program
- dynamic programming
- linear programming
- np hard
- strongly polynomial
- learning algorithm
- computational complexity
- linear programming problems
- worst case
- dna computing
- extreme points
- knapsack problem
- primal dual
- cost function
- simplex method
- convergence rate
- mixed integer
- quadratic programming
- integer program
- computationally intensive
- interior point
- greedy algorithm
- constraint programming
- search algorithm
- mixed integer linear program
- optimal policy