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 4 items.
- Integer programming as a framework for optimization and approximability (Q1276163) (← links)
- Supermodular functions and the complexity of MAX CSP (Q2387428) (← links)
- Generalized network design polyhedra (Q3100692) (← links)
- Parallel approximation to high multiplicity scheduling problems<i>VIA</i>smooth multi-valued quadratic programming (Q3515460) (← links)
