The following pages link to (Q4375770):
Displayed 14 items.
- An LPCC approach to nonconvex quadratic programs (Q431005) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- A framework for reasoning under uncertainty based on non-deterministic distance semantics (Q541819) (← links)
- Simplified forms of computerized reasoning with distance semantics (Q545150) (← links)
- A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem (Q734870) (← links)
- An efficient solver for weighted Max-SAT (Q933784) (← links)
- Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT (Q1841891) (← links)
- Evaluating the impact of AND/OR search on 0-1 integer linear programming (Q2267805) (← links)
- Probabilistic logic with independence (Q2379311) (← links)
- Solving the weighted MAX-SAT problem using the dynamic convexized method (Q2439524) (← links)
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability (Q2457672) (← links)
- Exact MAX-2SAT solution via lift-and-project closure (Q2466587) (← links)
- Semidefinite Programming and Constraint Programming (Q2802541) (← links)
- ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver (Q5015596) (← links)