Simulating Cutting Plane proofs with restricted degree of falsity by Resolution
Edward A. HirschSergey I. NikolenkoPublished in: Electron. Colloquium Comput. Complex. (2005)
Keyphrases
- supply chain
- cutting plane
- cutting plane algorithm
- integer programming
- lower bound
- column generation
- mixed integer
- mixed integer linear programming
- knapsack problem
- integer program
- exact penalty
- maximum margin
- valid inequalities
- truth values
- bayesian networks
- heuristic search
- linear programming
- search space
- computational complexity