Linear and Integer Programming vs Linear Integration and Counting

2. Introduction
Jean-Bemard Lasserre

3. The Linear Integration Problem I
Jean-Bemard Lasserre

4. Comparing the Continuous Problems P and I
Jean-Bemard Lasserre

5. The Linear Counting Problem Id

Jean-Bemard Lasserre

6. Relating the Discrete Problems Pd and Id with P
Jean-Bemard Lasserre

7. Duality and Gomory Relaxations
Jean-Bemard Lasserre

8. Barvinok’s Counting Algorithm and Gomory Relaxations
Jean-Bemard Lasserre

9. A Discrete Farkas Lemma
Jean-Bemard Lasserre

10. The Integer Hull of a Convex Rational Polytope
Jean-Bemard Lasserre

11. Duality and Superadditive Functions
Jean-Bemard Lasserre

Nyckelord: Mathematics, Convex and Discrete Geometry, Discrete Mathematics in Computer Science, Optimization, Operations Research, Mathematical Programming