11 citations · 47 across the 48 of their papers we have counts for
Showing 2020 · math.COShow all
2 papers · 2 filters
math.CO2020
Complexity of linear relaxations in integer programming
Gennadiy Averkov, Matthias Schymura
For a set of integer points in a polyhedron, the smallest number of facets of any polyhedron whose set of integer points coincides with is called the relaxation complexity…
math.CO2020
The lattice of cycles of an undirected graph
Gennadiy Averkov, Anastasia Chavez, Jesus A. De Loera +1
We study bases of the lattice generated by the cycles of an undirected graph, defined as the integer linear combinations of the 0/1-incidence vectors of cycles. We prove structural…