Non-Standard Approaches to Integer Programming.
In this survey we address three of the principle algebraic approaches to integer programming. After introducing lattices and basis reduction, we first survey their use in integer programming, presenting among others Lenstra's algorithm that is polynomial in fixed dimension, and the solution of diophanine equations using basis reduction. The second topic concerns augmentation algorithms and test sets, including the role played by Hilbert and Grobner bases in the development of a primal approach to solve a family of problems for all right-hand sides. Thirdly we survey the group approach of Gomory, showing the importance of subadditivity in integer programming and the generation of valid inequalities, as well as the relation to the parametric problem cited above of solving for all right-hand sides.
Year of publication: |
2000
|
---|---|
Authors: | Aardal, K. ; Weismantel, R. ; Wosley, L. |
Institutions: | Center for Operations Research and Econometrics (CORE), École des Sciences Économiques de Louvain |
Subject: | ECONOMETRICS |
Saved in:
Saved in favorites
Similar items by subject
-
Power of tests in Binary Response Models.
Savin, N.E., (1996)
-
The Climate Change Footprint: Will We See It Before It Is Upon Us?
Kelly, D.L., (1996)
-
Bayesian Inference on Garch Models Using the Gibbs Sampler.
Bauwens, L., (1996)
- More ...
Similar items by person