Return to Colloquia & Seminar listing
Lenstra's algorithm, quasiconvex integer minimization, and maximal lattice free convex sets
Student-Run Discrete Math SeminarSpeaker: | Robert Hildebrand, UC Davis |
Location: | 1147 MSB |
Start time: | Thu, Apr 28 2011, 11:00AM |
I will be presenting my qualifying exam talk, which is on an algorithm for non-linear integer optimization and also on maximal lattice free convex sets and their relation to mixed-integer programming.