Pages that link to "Item:Q1770383"
From MaRDI portal
The following pages link to The approximability of non-Boolean satisfiability problems and restricted integer programming (Q1770383):
Displaying 9 items.
- Integer programming as a framework for optimization and approximability (Q1276163) (← links)
- Parallel approximation algorithms by positive linear programming (Q1386460) (← links)
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695) (← links)
- Inapproximability results for set splitting and satisfiability problems with no mixed clauses (Q1879246) (← links)
- Supermodular functions and the complexity of MAX CSP (Q2387428) (← links)
- Polynomial threshold reoptimization of generalized satisfiability problems with bounded arity predicates (Q2850118) (← links)
- Generalized network design polyhedra (Q3100692) (← links)
- Parallel approximation to high multiplicity scheduling problems<i>VIA</i>smooth multi-valued quadratic programming (Q3515460) (← links)
- (Q4636519) (← links)