Proof of Concept: Fast Solutions to NP-problems by Using SAT and Integer Programming Solvers
Rastislav LenhardtPublished in: CoRR (2010)
Keyphrases
- integer programming
- np hard
- integer programming formulations
- constraint programming
- inference problems
- set covering problem
- combinatorial problems
- benchmark problems
- integer program
- np complete
- sat instances
- cutting plane
- search heuristics
- column generation
- transportation problem
- sat solvers
- cutting plane algorithm
- exact methods
- search strategies
- linear programming
- backtracking search
- lower bound
- propositional satisfiability
- dantzig wolfe decomposition
- sat solving
- search procedures
- exact algorithms
- efficient solutions
- production planning
- combinatorial optimization
- optimization problems
- lp relaxation
- bi objective
- mixed integer programming
- set covering
- sat problem
- sat encodings
- multi objective
- search space
- computational complexity