scientific article; zbMATH DE number 956857

zbMath0864.90102MaRDI QIDQ5687265

Tunçel, Levent, William H. Cunningham, Yaoguang Wang, Joseph Cheriyan

Publication date: 11 December 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

upper boundrandomized algorithmlower boundmaximum satisfiabilitycutting plane algorithmmax 2-sat problempolyhedral cutting planes

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (12)

Analysis and solving SAT and MAX-SAT problems using an \(L\)-partition approach ⋮ 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. ⋮ An efficient solver for weighted Max-SAT ⋮ Exact MAX-2SAT solution via lift-and-project closure ⋮ Exact Algorithms for MAX-SAT ⋮ Programming for modular reconfigurable robots ⋮ Semidefinite Programming and Constraint Programming ⋮ A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem ⋮ Unnamed Item ⋮ Separating subdivision of bicycle wheel inequalities over cut polytopes ⋮ Improving exact algorithms for MAX-2-SAT

This page was built for publication: