Pages that link to "Item:Q1785369"

The following pages link to Some lower bounds on sparse outer approximations of polytopes (Q1785369):

Displaying 7 items.

• Approximating polyhedra with sparse inequalities (Q896289) (← links)
• Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899) (← links)
• Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q2164683) (← links)
• Sparsity of integer formulations for binary programs (Q2294334) (← links)
• Approximation of convex bodies by multiple objective optimization and an application in reachable sets (Q5745164) (← links)
• Beating the SDP bound for the floor layout problem: a simple combinatorial idea (Q5882276) (← links)