Login / Signup

Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems.

Michael LewinDror LivnatUri Zwick
Published in: IPCO (2002)
Keyphrases
  • max sat
  • weighted max sat
  • linear programming
  • practical problems
  • genetic algorithm
  • search algorithm
  • upper bound
  • branch and bound algorithm
  • sat solvers
  • probabilistic planning