The following pages link to (Q5687265):
Displaying 12 items.
- Analysis and solving SAT and MAX-SAT problems using an \(L\)-partition approach (Q367248) (← links)
- A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem (Q734870) (← links)
- Improving exact algorithms for MAX-2-SAT (Q812398) (← links)
- An efficient solver for weighted Max-SAT (Q933784) (← links)
- Separating subdivision of bicycle wheel inequalities over cut polytopes (Q1306466) (← links)
- Max Horn SAT and the minimum cut problem in directed hypergraphs (Q1380929) (← links)
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. (Q1408377) (← links)
- Programming for modular reconfigurable robots (Q1758696) (← links)
- Exact MAX-2SAT solution via lift-and-project closure (Q2466587) (← links)
- Semidefinite Programming and Constraint Programming (Q2802541) (← links)
- Exact Algorithms for MAX-SAT (Q4916231) (← links)
- (Q5148942) (← links)
