The following pages link to (Q5668612):
Displaying 16 items.
- \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation (Q730482) (← links)
- Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope (Q761350) (← links)
- Logical processing for integer programming (Q817209) (← links)
- Compact normal forms in propositional logic and integer programming formulations (Q910335) (← links)
- Logic applied to integer programming and integer programming applied to logic (Q1130078) (← links)
- Almost integral polyhedra related to certain combinatorial optimization problems (Q1240148) (← links)
- The splitting of variables and constraints in the formulation of integer programming models (Q1278148) (← links)
- A number theoretic reformulation and decomposition method for integer programming (Q1394028) (← links)
- Logic cuts for multilevel generalized assignment problems. (Q1406973) (← links)
- Strong valid inequalities for Boolean logical pattern generation (Q1675646) (← links)
- Graph, clique and facet of Boolean logical polytope (Q2124813) (← links)
- A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation (Q2274853) (← links)
- Achieving consistency with cutting planes (Q2687054) (← links)
- A direct dual method for the mixed plant location problem with some side constraints (Q3206665) (← links)
- Coefficient reduction for inequalities in 0–1 variables (Q4044367) (← links)
- Facets of the knapsack polytope (Q4077731) (← links)
