Pages that link to "Item:Q4018154"
From MaRDI portal
The following pages link to Input Proofs and Rank One Cutting Planes (Q4018154):
Displaying 12 items.
- Learning from conflicts in propositional satisfiability (Q427560) (← links)
- Algorithms for the maximum satisfiability problem (Q753502) (← links)
- Resolution vs. cutting plane solution of inference problems: Some computational experience (Q1100093) (← links)
- Logic applied to integer programming and integer programming applied to logic (Q1130078) (← links)
- New methods for computing inferences in first order logic (Q1309900) (← links)
- Generalized resolution for 0--1 linear inequalities (Q1354004) (← links)
- Branch-and-cut solution of inference problems in propositional logic (Q1356213) (← links)
- Mixed logical-linear programming (Q1961464) (← links)
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability (Q2457672) (← links)
- What we can learn from conflicts in propositional satisfiability (Q2630816) (← links)
- Analyzing read-once cutting plane proofs in Horn systems (Q2673307) (← links)
- Achieving consistency with cutting planes (Q2687054) (← links)
