Showing 1–20 of 34 results
/ Date/ Name
Nov 27, 2019Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd CyclesNov 16, 2021Lattice-free simplices with lattice width $2d - o(d)$Jan 26, 2018Distances of optimal solutions of mixed-integer programsApr 10, 2025Multiplicative assignment with upgradesAug 31, 2023Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and KnapsackJun 18, 2014Computing The Extension Complexities of All 4-Dimensional 0/1-PolytopesMay 25, 2018Extended Formulations for Radial ConesAug 17, 2019The stable set problem in graphs with bounded genus and bounded odd cycle packing numberNov 17, 2020A Simple Method for Convex Optimization in the Oracle ModelApr 10, 2014Hidden Vertices in Extensions of PolytopesMay 27, 2016Maximum Semidefinite and Linear Extension Complexity of Families of PolytopesDec 6, 2017Lifting Linear Extension Complexity Bounds to the Mixed-Integer SettingNov 3, 2017Strengthening Convex Relaxations of 0/1-Sets Using Boolean FormulasNov 13, 2013Lower Bounds on the Sizes of Integer Programs Without Additional VariablesOct 27, 2016Optimality certificates for convex minimization and Helly numbersNov 20, 2016Characterizing Polytopes Contained in the $0/1$-Cube with Bounded Chvátal-Gomory RankAug 17, 2020Binary scalar productsFeb 16, 2022The Pareto cover problemJul 12, 2013A Short Proof that the Extension Complexity of the Correlation Polytope Grows ExponentiallyFeb 7, 2017Extension complexities of Cartesian products involving a pyramid