Abstract
We overview our recently introduced theory of n-fold integer programming which enables the polynomial time solution of fundamental linear and nonlinear integer programming problems in variable dimension. We demonstrate its power by obtaining the first polynomial time algorithms in several application areas including multicommodity ows and privacy in statistical databases.
| Original language | Undefined/Unknown |
|---|---|
| Title of host publication | Mixed Integer Nonlinear Programming |
| Editors | Jon Lee, Sven Leyffer |
| Place of Publication | New York, NY |
| Publisher | Springer New York |
| Pages | 559-593 |
| Number of pages | 35 |
| ISBN (Print) | 978-1-4614-1927-3 |
| State | Published - 2012 |