activity
20102026
most citedA new Lenstra-type Algorithm for Quasiconvex Polynomial Integer Minimization with Complexity 2^O(n log n)

38 citations · 129 across the 25 of their papers we have counts for

collaborators
Showing 2017 · math.OCShow all

1 paper · 2 filters

math.OC2017

Minimal cut-generating functions are nearly extreme

Amitabh Basu, Robert Hildebrand, Marco Molinaro

We study continuous (strongly) minimal cut generating functions for the model where all variables are integer. We consider both the original Gomory-Johnson setting as well as a rec…