Pages that link to "Item:Q2583148"
From MaRDI portal
The following pages link to Approximate fixed-rank closures of covering problems (Q2583148):
Displayed 9 items.
- On the membership problem for the \({0, 1/2}\)-closure (Q408382) (← links)
- Tightening simple mixed-integer sets with guaranteed bounds (Q431027) (← links)
- Approximate formulations for 0-1 knapsack sets (Q943790) (← links)
- Aggregation-based cutting-planes for packing and covering integer programs (Q1785202) (← links)
- Pitch, extension complexity, and covering problems (Q2060545) (← links)
- Strengthening convex relaxations of 0/1-sets using Boolean formulas (Q2235155) (← links)
- Approximate fixed-rank closures of covering problems (Q2583148) (← links)
- On inequalities with bounded coefficients and pitch for the min knapsack polytope (Q2673233) (← links)
- High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts (Q5853720) (← links)