A primal all-integer algorithm based on irreducible solutions

Mathematical Programming, Series B

Volumn 96, Issue 2, 2003, Pages 205-246

  Haus, Utz Uwe ^a   Köppe, Matthias ^a   Weismantel, Robert ^a  

^a OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; INTEGER PROGRAMMING; ITERATIVE METHODS; LINEAR SYSTEMS; PROBLEM SOLVING;

ALGORITHM ITERATIVELY; AUGMENTATION ALGORITHMS; LINEAR DIOPHANTINE; SUBPROBLEM;

ALGORITHMS;

EID: 2342592952     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-003-0384-8     Document Type: Article

References (31)

1. [AHL00] Aardal, K., Hurkens, C.A.J., Lenstra, A.K.: Solving a system of diophantine equations with lower and upper bounds on the variables. Math. Operations Res. 25, 427-442 (2000)
2. [AWW00] Aardal, K., Weismantel, R., Wolsey, L.A.: Non-standard approaches to integer programming. CORE Discussion Paper, no. 2000/2, Université Catholique de Louvain, CORE, Voie du Roman Pays 34, B-1348 Louvain-la-Neuve, Belgium, January 2000
3. [BCMS98] Bixby, R.E., Ceria, S., McZeal, CM., Savelsbergh, M.W.P.: An updated mixed integer programming library: MIPLIB 3.0. Optima 58, 12-15 (1998)
4. [BIC62] Ben-Israel, A., Charnes, A.: On some problems of diophantine programming. Cahiers du Centre d'Études de Recherche Opé rationnelle 4, 215-280 (1962)
5. [BP75] Balas, E., Padberg, M.: On the set-covering problem: II. An algorithm for set partitioning. Operations Research 23, 74-90 (1975)
6. [CRSS93] Cook, W., Rutherford, T., Scarf, H.E., Shallcross, D.: An implementation of the generalized basis reduction algorithm for integer programming. ORSA Journal on Computing 5(2), 206-212 (1993)
7. [CT91] Conti, P., Traverso, C.: Buchberger algorithm and integer programming. Proceedings of the AAECC-9, Lecture Notes in Computer Science 539, Springer, Berlin, 1991, pp. 130-139
8. [DGS96] Diaconis, P., Graham, R.L., Sturmfels, B.: Primitive partition identities. Combinatorics, Paul Erdos is Eighty, Volume 2 (D. Miklós, V. T. Sós, D. Szõnyi, eds.), Bolyai Society Mathematical Studies, vol. 2, 1996, pp. 173-192
9. [GHK+02] Gentile, C., Haus, U.-U., Köppe, M., Rinaldi, G., Weismantel, R.: On the way to perfection: A new combinatorial algorithm for stable sets in graphs. To appear in M. Grötschel, editor, The Sharpest Cut, Festschrift in honor of Manfred Padberg. MPS/SIAM, preprint available from URL http://www.math.uni-magdeburg.de/~mkoeppe/art/primstab.ps, 2002
10. [Glo68] Glover, F.: A new foundation for a simplified primal integer programming algorithm. Operations Res. 16, 727-740 (1968)
11. [GN72] Garfinkel, R.S., Nemhauser, G.L.: Integer programming. Wiley, New York, 1972
12. [Gom58] Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Mathematical Society 64, 275-278 (1958)
13. [Gom60] Gomory, R.E.: An algorithm for the mixed integer problem. Tech. Report RM-2597-PR, The RAND Corporation, Santa Monica, CA, 1960
14. [Gom63] Gomory, R.E.: An all-integer integer programming algorithm. Industrial Scheduling (J. F. Muth and G. L. Thompson, eds.), Prentice-Hall international series in management, Prentice Hall, Englewood Cliffs, N.J., 1963, pp. 193-206
15. [Hec95] Heckler, C.: Automatische Parallelisierung und parallele Gitterbasisreduktion. Dissertation, Institut für Mikroelektronik, Universität des Saarlandes, Saarbrücken, Germany, 1995
16. [HKW01] Haus, U.-U., Köppe, M., Weismantel, R.: The Integral Basis Method for integer programming. Math. Methods Operations Res. 53(3), 353-361 (2001)
17. [HT98] Heckler, C., Thiele, L.: Complexity analysis of a parallel lattice basis reduction algorithm. SIAM J. Comput. 27(5), 1295-1302 (1998) (electronic)
18. [Hu69] Hu, T.C.: Integer programming and network flows. Addison-Wesley, Reading, Mass., 1969
19. [HW00] Henk, M., Weismantel, R.: On minimal solutions of diophantine equations. Beiträge zur Algebra und Geometrie 41 (1), 49-55 (2000)
20. [Köp99] Koppe, M.: Erzeugende Mengen für gemischt-ganzzahlige Programme. Diploma thesis, Ottovon-Guericke-Universität Magdeburg, 1999, available from URL http://www.math.unimagdeburg.de/~mkoeppe/art/mkoeppe-diplom. ps
21. [Lam87] Lambert, J.L.: Une borne pour les générateurs des solutions entiéres positives d'une équation diophantienne linéaire. C.R. Acad. Sci. Paris 305, 39-40 (1987)
22. [Len83] Lenstra, Jr. H.W.: Integer programming with a fixed number of variables. Mathematics of Operations Research 8, 538-548 (1983)
23. [LLL82] Lenstra, A.K., Lenstra, Jr. H.W., Lovász, L.: Factoring polynomials with rational coefficients. Mathematische Annalen 261, 515-534 (1982)
24. [Mic98] Micciancio, D.: The shortest vector in a lattice is hard to approximate to within some constant. IEEE Symposium on Foundations of Computer Science, 1998, pp. 92-98
25. [PH80] Padberg, M.W., Hong, S.: On the symmetric travelling salesman problem: a computational study. Math. Programming Stud. no. 12, 78-107 (1980)
26. [SE94] Schnorr, C.-P., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Programming 66(2), Ser. A, 181-199 (1994)
27. [Tho95] Thomas, R.R.: A geometric Buchberger algorithm for integer programming. Mathematics of Operations Research 20, 864-884 (1995)
28. [UWZ97] Urbaniak, R., Weismantel, R., Ziegler, G.: A variant of Buchberger's algorithm for integer programming, SIAM Journal on Discrete Mathematics 1, 96-108 (1997)
29. [Wei98] Weismantel, R.: Test sets of integer programs. Mathematical Methods of Operations Research 47, 1-37 (1998)
30. [You68] Young, R.D.: A simplified primal (all-integer) integer programming algorithm. Operations Research 16(4), 750-782 (1968)
31. [You75] Young, R.D.: The eclectic primal algorithm: Cutting-plane method that accommodates hybrid subproblem solution techniques. Math. Program. 9, 294-312 (1975)