Approximation Techniques for Integer Programming ProblemsSteve HartkeMon Mar. 8 at 1:10pm in the Graduate Student Lounge Integer Programming (IP) problems are in general NP hard. I will outline some high-level paradigms for approximating an IP problem, and illustrate with one or two examples for each approach. I will be following the outline described by Gerhard Woeginger in his survey article found at: http://wwwhome.cs.utwente.nl/~woegingergj/papers/ptas.ps (or .pdf) I will also describe my specific interest in this area. |
| Back | This page last modified March 1, 2004. |