Return to Colloquia & Seminar listing
Algorithms for testing Feasibility of Integer Programs
Student-Run Research| Speaker: | Ruriko Yoshida, UC Davis Mathematics |
| Location: | 593 Kerr |
| Start time: | Thu, May 23 2002, 4:10PM |
Description
We will survey the geometric ideas used in the known algorithms for testing whether a polyhedron
contains an integer lattice point. We discuss
applications to Transportation Problems.