Pages that link to "Item:Q6156096"
From MaRDI portal
The following pages link to On the extension complexity of polytopes separating subsets of the Boolean cube (Q6156096):
Displaying 6 items.
- On approximation of asymmetric separators of the \(n\)-cube (Q361217) (← links)
- On the extension complexity of combinatorial polytopes (Q745682) (← links)
- Extension complexity of stable set polytopes of bipartite graphs (Q1687905) (← links)
- On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube (Q2419579) (← links)
- (Q3268313) (← links)
- Efficient MIP techniques for computing the relaxation complexity (Q6095738) (← links)