Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
sav07_lecture_3_skeleton [2007/03/21 09:51] vkuncak |
sav07_lecture_3_skeleton [2007/03/21 10:01] vkuncak |
||
|---|---|---|---|
| Line 150: | Line 150: | ||
| Proof: small model theorem. | Proof: small model theorem. | ||
| + | |||
| Line 163: | Line 164: | ||
| where $A \in {\cal Z}^{m,n}$ and $x \in {\cal Z}^n$. | where $A \in {\cal Z}^{m,n}$ and $x \in {\cal Z}^n$. | ||
| - | Then use small model theorem for integer linear programming (ILP). | + | Then solve integer linear programming (ILP) problem |
| + | * [[wk>Integer Linear Programming]] | ||
| + | * online book chapter on ILP | ||
| + | * [[http://www.gnu.org/software/glpk/|GLPK]] tool | ||
| + | |||
| + | We can prove small model theorem for ILP - gives bound on search. | ||
| Short proof by {{papadimitriou81complexityintegerprogramming.pdf|Papadimitriou}}. | Short proof by {{papadimitriou81complexityintegerprogramming.pdf|Papadimitriou}}. | ||