Pages that link to "Item:Q1354004"
From MaRDI portal
The following pages link to Generalized resolution for 0--1 linear inequalities (Q1354004):
Displaying 15 items.
- Projection, consistency, and George Boole (Q265702) (← links)
- Projecting systems of linear inequalities with binary variables (Q646699) (← links)
- Resolution vs. cutting plane solution of inference problems: Some computational experience (Q1100093) (← links)
- Logic cuts for processing networks with fixed charges (Q1317071) (← links)
- Resolution and the integrality of satisfiability problems (Q1352293) (← links)
- Branch-and-cut solution of inference problems in propositional logic (Q1356213) (← links)
- Logic cuts for multilevel generalized assignment problems. (Q1406973) (← links)
- Many-valued logic and mixed integer programming (Q1924752) (← links)
- Mixed logical-linear programming (Q1961464) (← links)
- Non-clausal redundancy properties (Q2055860) (← links)
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search (Q2074664) (← links)
- A branching algorithm to solve binary problem in uncertain environment: an application in machine allocation problem (Q2329577) (← links)
- Achieving consistency with cutting planes (Q2687054) (← links)
- Simplifying clausal satisfiability problems (Q5096298) (← links)
- Completeness of cutting planes revisited (Q5224684) (← links)