activity
20202026
most citedComplexity of branch-and-bound and cutting planes in mixed-integer optimization

1 citations · 1 across the 9 of their papers we have counts for

collaborators
Showing 2021Show all

2 papers · 1 filter

math.OC2021

Helly systems and certificates in optimization

Amitabh Basu, Tongtong Chen, Michele Conforti +1

Inspired by branch-and-bound and cutting plane proofs in mixed-integer optimization and proof complexity, we develop a general approach via Hoffman's Helly systems. This helps to d…

math.CO2021

Enumerating integer points in polytopes with bounded subdeterminants

Hongyi Jiang, Amitabh Basu

We show that one can enumerate the vertices of the convex hull of integer points in polytopes whose constraint matrices have bounded and nonzero subdeterminants, in time polynomial…