Publication:5687265
From MaRDI portal
zbMath0864.90102MaRDI QIDQ5687265
Tunçel, Levent, Joseph Cheriyan, William H. Cunningham, Yaoguang Wang
Publication date: 11 December 1996
upper bound; randomized algorithm; lower bound; maximum satisfiability; cutting plane algorithm; max 2-sat problem; polyhedral cutting planes
90C35: Programming involving graphs or networks
90C10: Integer programming
90C27: Combinatorial optimization
Related Items
Exact Algorithms for MAX-SAT, Analysis and solving SAT and MAX-SAT problems using an \(L\)-partition approach, A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem, Improving exact algorithms for MAX-2-SAT, An efficient solver for weighted Max-SAT, Separating subdivision of bicycle wheel inequalities over cut polytopes, Max Horn SAT and the minimum cut problem in directed hypergraphs, Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT., Programming for modular reconfigurable robots, Exact MAX-2SAT solution via lift-and-project closure, Semidefinite Programming and Constraint Programming