most citedAlgorithmic and Complexity Results for Cutting Planes Derived from Maximal Lattice-Free Convex Sets

7 citations · 12 across the 3 of their papers we have counts for

collaborators
Showing math.OCShow all

1 paper · 1 filter

math.OC2010

On the complexity of nonlinear mixed-integer optimization

Matthias Köppe

This is a survey on the computational complexity of nonlinear mixed-integer optimization. It highlights a selection of important topics, ranging from incomputability results that a…