Friday, March 4, 2016 3:30 pm
-
3:30 pm
EST (GMT -05:00)
Title:
On
some
polytopes
contained
in
the
0,1
hypercube
that
have
a
small
chvatal
rank
Speaker: | Gerard Cornuejols |
Affiliation: | Carnegie Mellon University |
Room: | MC 5501 |
Abstract: This talk is based on joint work with Dabeen Lee. We consider polytopes P that are contained in the unit hypercube. We provide conditions on the set of infeasible 0,1 vectors that guarantee that P has a small Chvatal rank. Our conditions are in terms of the subgraph induced by these infeasible 0,1 vertices in the skeleton graph of the unit hypercube. In particular, we show that when this subgraph contains no 4-cycle, the Chvatal rank is at most 3; and when it has tree width 2, the Chvatal rank is at most 4. We also give polyhedral decomposition theorems when this graph has a vertex cutset of size one or two.