A linear programming and rounding approach to max 2-sat.
Joseph CheriyanWilliam H. CunninghamLevent TunçelYaoguang WangPublished in: Cliques, Coloring, and Satisfiability (1993)
Keyphrases
- linear programming
- max sat
- linear program
- weighted max sat
- graph coloring
- feasible solution
- np hard
- optimal solution
- column generation
- dynamic programming
- objective function
- lower bound
- maximum satisfiability
- integer programming
- mixed integer
- variable ordering
- max sat solver
- boolean satisfiability
- valid inequalities
- unsatisfiable cores
- satisfiability problem
- branch and bound
- cnf formula