{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T16:41:29Z","timestamp":1775839289676,"version":"3.50.1"},"reference-count":109,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3911,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1016\/s0166-218x(01)00337-7","type":"journal-article","created":{"date-parts":[[2002,10,11]],"date-time":"2002-10-11T17:32:51Z","timestamp":1034357571000},"page":"5-74","source":"Crossref","is-referenced-by-count":48,"title":["Non-standard approaches to integer programming"],"prefix":"10.1016","volume":"123","author":[{"given":"Karen","family":"Aardal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Weismantel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurence A.","family":"Wolsey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00337-7_BIB1","series-title":"Integer Programming and Combinatorial Optimization, 7th International IPCO Conference","first-page":"1","article-title":"Market split and basis reduction: towards a solution of the Cornu\u00e9jols\u2013Dawande instances","volume":"Vol. 1610","author":"Aardal","year":"1999"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB2","series-title":"Integer Programming and Combinatorial Optimization, 6th International IPCO Conference","first-page":"229","article-title":"Solving a linear diophantine equation with lower and upper bounds on the variables","volume":"Vol. 1412","author":"Aardal","year":"1998"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB3","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1287\/moor.25.3.427.12219","article-title":"Solving a system of diophantine equations with lower and upper bounds on the variables","volume":"25","author":"Aardal","year":"2000","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB4","series-title":"Network flows: theory, algorithms, and applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB5","doi-asserted-by":"crossref","unstructured":"M. Ajtai, The shortest vector problem in L2 is NP-hard for randomized reductions, in Proceedings of the 30th Annual ACM Symposium on the Theory of Computing, ACM, New York, NY, 1998, pp. 10\u201319.","DOI":"10.1145\/276698.276705"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB6","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1287\/opre.23.1.74","article-title":"On the set covering problem II. An algorithm for set partitioning","volume":"23","author":"Balas","year":"1975","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB7","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/moor.19.4.769","article-title":"A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed","volume":"19","author":"Barvinok","year":"1994","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB8","series-title":"Gr\u00f6bner bases: a computational approach to commutative algebra","author":"Becker","year":"1993"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB9","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1287\/opre.25.3.419","article-title":"A convergent duality theory for integer programming","volume":"25","author":"Bell","year":"1977","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB10","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1090\/S0002-9939-1976-0396605-3","article-title":"Bounds on positive integral solutions of linear diophantine equations","volume":"55","author":"Borosh","year":"1976","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB11","unstructured":"J. Bourgain, V.D. Milman, Sections euclidiennes et volume des corps sym\u00e9triques convexes dans Rn, C. R. Acad. Sc. Paris t. 300, S\u00e9rie I, (13) (1985) 435\u2013438."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB12","unstructured":"W. Bruns, J. Gubeladze, Normality and covering properties, preprint, University of Osnabr\u00fcck, 1998."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB13","first-page":"123","article-title":"Normal polytopes, triangulations, and Koszul algebras","volume":"485","author":"Bruns","year":"1997","journal-title":"J. Reine Angew. Math."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB14","unstructured":"W. Bruns, J. Gubeladze, M. Henk, A. Martin, R. Weismantel, A counterexample to an integer analogue of Carath\u00e9odory's Theorem, Preprint No. 32, Universit\u00e4t Magdeburg, 1998."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB15","doi-asserted-by":"crossref","unstructured":"B. Buchberger, Gr\u00f6bner bases: an algorithmic method in Polynomial Ideal Theory, in: N.K. Bose (Ed.), Multidimensional Systems Theory, D. Reidel Publications, Dordrecht, 1985, pp. 184\u2013232.","DOI":"10.1007\/978-94-009-5225-6_6"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB16","unstructured":"J.-Y. Cai, A.P. Nerurkar, Approximating the svp to within a factor (1+1\/dim\u03f5) is NP-hard under randomized reductions, Manuscript, 1997."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB17","series-title":"A Course in Computational Algebraic Number Theory","author":"Cohen","year":"1996"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB18","doi-asserted-by":"crossref","unstructured":"P. Conti, C. Traverso, Buchberger algorithm and integer programming, Proceedings AAECC-9 (New Orleans), Lecture Notes in Computer Science, Vol. 539, Springer, Berlin 1991, pp. 130\u2013139.","DOI":"10.1007\/3-540-54522-0_102"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB19","doi-asserted-by":"crossref","unstructured":"S.A. Cook, The complexity of theorem-proving procedures, in Proceedings of Third Annual ACM Symposium on Theory of Computing, ACM, New York, 1991, pp. 151\u2013158.","DOI":"10.1145\/800157.805047"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB20","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01582230","article-title":"Sensitivity results in integer programming","volume":"34","author":"Cook","year":"1986","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB21","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0095-8956(86)90064-X","article-title":"An integer analogue of Carath\u00e9odory's theorem","volume":"40","author":"Cook","year":"1986","journal-title":"J. Combin. Theory (B)"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB22","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01582230","article-title":"Sensitivity theorems in integer programming problems","volume":"34","author":"Cook","year":"1986","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB23","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1287\/ijoc.5.2.206","article-title":"An implementation of the generalized basis reduction algorithm for integer programming","volume":"5","author":"Cook","year":"1993","journal-title":"ORSA J. Comput."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB24","series-title":"Integer Programming and Combinatorial Optimization, 6th International IPCO Conference","first-page":"284","article-title":"A class of hard small 0\u20131 programs","volume":"Vol. 1412","author":"Cornu\u00e9jols","year":"1998"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB25","series-title":"Algorithms\u2014ESA \u201997","first-page":"92","article-title":"Decomposition of integer programs and of generating sets","volume":"Vol. 1284","author":"Cornu\u00e9jols","year":"1997"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB26","first-page":"368","article-title":"\u00dcber Systeme von linear-homogenen Gleichungen und Ungleichungen","volume":"34","author":"van der Corput","year":"1931","journal-title":"Proceedings Koninklijke Akademie van Wetenschappen te Amsterdam"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB27","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01201999","article-title":"Improved low-density subset sum algorithms","volume":"2","author":"Coster","year":"1992","journal-title":"Comput. Complexity"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB28","series-title":"Ideals, varieties, and algorithms: an introduction to computational algebraic geometry and commutative algebra","author":"Cox","year":"1992"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB29","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/BF03322085","article-title":"On crepant resolutions of 2-parameter series of Gorenstein cyclic quotient singularities","volume":"33","author":"Dais","year":"1998","journal-title":"Results Math."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB30","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1287\/moor.22.3.545","article-title":"On Barvinok's algorithm for counting lattice points in fixed dimension","volume":"22","author":"Dyer","year":"1997","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB31","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","article-title":"Theoretical improvements in algorithmic efficiency for network flow problems","volume":"19","author":"Edmonds","year":"1972","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB32","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","article-title":"A min-max relation for submodular functions on graphs, in Studies in Integer Programming, P.L. Hammer et al. eds","volume":"1","author":"Edmonds","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB33","series-title":"Another NP-complete partition problem and the complexity of computing short vectors in a lattice, Report 81-04, Mathematical Institute","author":"van Emde Boas","year":"1981"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB34","series-title":"Combinatorial Convexity and Algebraic Geometry","volume":"Vol. 168","author":"Ewald","year":"1996"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB35","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/PL00009416","article-title":"Hilbert bases, unimodular triangulations, and binary covers of rational polyhedral cones","volume":"21","author":"Firla","year":"1999","journal-title":"Discrete Computational Geometry"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB36","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0024-3795(79)90018-1","article-title":"Total dual integrality and integer polyhedra","volume":"25","author":"Giles","year":"1979","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB37","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02591882","article-title":"Variable metric relaxation methods, Part II: the ellipsoid method","volume":"30","author":"Goffin","year":"1984","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB38","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0020-0190(99)00083-6","article-title":"Approximating shortest lattice vectors is not harder than approximating closest lattice vectors","volume":"71","author":"Goldreich","year":"1999","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB39","series-title":"Industrial Scheduling","first-page":"193","article-title":"An all-integer integer programming algorithm","author":"Gomory","year":"1963"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB40","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1073\/pnas.53.2.260","article-title":"On the relation between integer and non-integer solutions to linear programs","volume":"53","author":"Gomory","year":"1965","journal-title":"Proc. Nat. Academy Sci."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB41","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1073\/pnas.57.1.16","article-title":"Faces of an integer polyhedron","volume":"57","author":"Gomory","year":"1967","journal-title":"Proc. Nat. Academy Sci."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB42","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","article-title":"Some polyhedra related to combinatorial problems","volume":"2","author":"Gomory","year":"1969","journal-title":"Linear Algeb. Appl."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB43","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF01584976","article-title":"Some continuous functions related to corner polyhedra","volume":"3","author":"Gomory","year":"1972","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB44","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF01442864","article-title":"\u00dcber die Aufl\u00f6sung linearer Gleichungen mit reellen Coefficienten","volume":"6","author":"Gordan","year":"1873","journal-title":"Math. Ann."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB45","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF01584659","article-title":"Computational experience with a group theoretic integer programming algorithm","volume":"4","author":"Gorry","year":"1973","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB46","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01681344","article-title":"On the foundations of linear and integer programming I","volume":"8","author":"Graver","year":"1975","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB47","series-title":"Handbook of Combinatorics","article-title":"Combinatorial optimization","author":"Gr\u00f6tschel","year":"1995"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB48","series-title":"Progress in Combinatorial Optimization","first-page":"167","article-title":"Geometric methods in combinatorial optimization","author":"Gr\u00f6tschel","year":"1984"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB49","series-title":"Geometric Algorithms and Combinatorial Optimization","author":"Gr\u00f6tschel","year":"1988"},{"issue":"3","key":"10.1016\/S0166-218X(01)00337-7_BIB50","doi-asserted-by":"crossref","DOI":"10.1007\/s001860100124","article-title":"The integral basis method for integer programming","volume":"53","author":"Haus","year":"2001","journal-title":"Math. Methods Oper. Res."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB51","unstructured":"U. Haus, M. K\u00f6ppe, R. Weismantel, A primal all-integer algorithm based on irreducible solutions, Manuscript, 2001."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB52","unstructured":"U. Haus, M. K\u00f6ppe, R. Weismantel, The integral basis method in an augmentation framework for integer programming, Manuscript, 2001."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB53","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/BF03322141","article-title":"The height of minimal Hilbert bases","volume":"32","author":"Henk","year":"1997","journal-title":"Results Math."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB54","first-page":"49","article-title":"On minimal solutions of Diophantine equations","volume":"41","author":"Henk","year":"2000","journal-title":"Contributions to Algebra and Geometry"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB55","unstructured":"M. Henk, R. Weismantel, A theorem about minimal solutions of linear Diophantine equations, Contributions to Algebra and Geometry, 1998, to appear."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB56","doi-asserted-by":"crossref","unstructured":"Ch. Hermite, Extraits de lettres de M. Ch. Hermite \u00e0 M. Jacobii sur diff\u00e9rents objets de la th\u00e9orie des nombres. J. angew. Math. 40 (1850) 261\u2013278, 279\u2013290, 291\u2013307, 308\u2013315, [reprinted in: \u00c9. Picard (Ed.), Oevres de Charles Hermite, Tome I, Gauthier-Villars, Paris, 1905, pp. 100\u2013121, 122\u2013135, 136\u2013155, 155\u2013163.]","DOI":"10.1515\/crll.1850.40.261"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB57","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1145\/321921.321936","article-title":"A polynomial-time algorithm for the knapsack problem with two variables","volume":"23","author":"Hirschberg","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB58","unstructured":"S. Hosten, R.R. Thomas, Standard pairs and group relaxations in integer programming, Technical Report, Department of Mathematics, Texas A&M University, February 1998."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB59","doi-asserted-by":"crossref","unstructured":"E.L. Johnson, Integer Programming\u2014Facets, Subadditivity and Duality for Group and Semi-Group Problems, SIAM Publications, Philadelphia, 1980.","DOI":"10.1137\/1.9781611970371"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB60","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s001459900042","article-title":"Lattice reduction: a toolbox for the cryptanalyst","volume":"11","author":"Joux","year":"1998","journal-title":"J. Cryptol."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB61","series-title":"Computer Algebra: Proceedings of EUROCAL \u201983, European Computer Algebra Conference","first-page":"236","article-title":"On the complexity of finding short vectors in integer lattices","volume":"Vol. 162","author":"Kaltofen","year":"1983"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB62","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1145\/322169.322179","article-title":"A polynomial algorithm for the two-variable integer programming problem","volume":"27","author":"Kannan","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB63","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1146\/annurev.cs.02.060187.001311","article-title":"Algorithmic geometry of numbers","volume":"2","author":"Kannan","year":"1987","journal-title":"Ann. Rev. Comput. Sci."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB64","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1287\/moor.12.3.415","article-title":"Minkowski's convex body theorem and integer programming","volume":"12","author":"Kannan","year":"1987","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB65","series-title":"Foundations of software technology and theoretical computer science","first-page":"193","article-title":"Covering minima and lattice point free convex bodies","volume":"Vol. 241","author":"Kannan","year":"1986"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB66","doi-asserted-by":"crossref","first-page":"577","DOI":"10.2307\/1971436","article-title":"Covering minima and lattice-point-free convex bodies","volume":"128","author":"Kannan","year":"1988","journal-title":"Ann. Math."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB67","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB68","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF02128669","article-title":"Korkine-Zolotarev bases and successive minima of a lattice and its reciprocal lattice","volume":"10","author":"Lagarias","year":"1990","journal-title":"Combinatorica"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB69","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1145\/2455.2461","article-title":"Solving low-density subset sum problems","volume":"32","author":"Lagarias","year":"1985","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB70","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","article-title":"Factoring polynomials with rational coefficients","volume":"261","author":"Lenstra","year":"1982","journal-title":"Mathematische Annalen"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB71","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","article-title":"Integer programming with a fixed number of variables","volume":"8","author":"Lenstra","year":"1983","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB72","unstructured":"LiDIA\u2014A library for computational number theory. TH Darmstadt\/Universit\u00e4t des Saarlandes, Fachbereich Informatik, Institut f\u00fcr Theoretische Informatik. http:\/\/www.informatik.th-darmstadt.de\/pub\/TI\/LiDIA."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB73","unstructured":"J. Liu, Hilbert bases with the Carath\u00e9odory property, PhD. Thesis, Cornell University, 1991."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB74","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/BF03322309","article-title":"On the height of the minimal Hilbert basis","volume":"23","author":"Liu","year":"1993","journal-title":"Results Math."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB75","series-title":"An Algorithmic Theory of Numbers, Graphs and Convexity","volume":"Vol. 50","author":"Lov\u00e1sz","year":"1986"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB76","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1287\/moor.17.3.751","article-title":"The generalized basis reduction algorithm","volume":"17","author":"Lov\u00e1sz","year":"1992","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB77","series-title":"Combining problem structure with basis reduction to solve a class of hard integer programs, CORE Discussion Paper 2000\/51, CORE, Universit\u00e9 Catholique de Louvain","author":"Louveaux","year":"2000"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB78","unstructured":"T. McCormick, A. Shioura, A minimum ratio cycle canceling algorithm for linear programming problems with application to network optimization, Manuscript, 1996."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB79","doi-asserted-by":"crossref","unstructured":"D. Micciancio, The shortest vector in a lattice is hard to approximate to within some constant, Proceedings of the 39th IEEE Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 1998, pp. 92\u201398.","DOI":"10.1109\/SFCS.1998.743432"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB80","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB81","series-title":"Convex bodies and algebraic geometry. An introduction to the theory of toric varieties, Ergebnisse der Mathematik und ihrer Grenzgebiete 3. Folge, Bd. 15","author":"Oda","year":"1988"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB82","first-page":"584","article-title":"Cryptanalytic attacks on the multivariate knapsack cryptosystem and on Shamir's fast signature scheme","volume":"4","author":"Odlyzko","year":"1984","journal-title":"IEEE Trans. Inform. Theory IT-30"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB83","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/BFb0120888","article-title":"On the symmetric travelling salesman problem: a computational study","volume":"12","author":"Padberg","year":"1980","journal-title":"Math. Programming Study"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB84","unstructured":"H. R\u00f6ck, Scaling techniques for minimal cost network flows, in Discrete Structures and Algorithms, Carl Hanser, M\u00fcnchen, 1980, pp. 181\u2013191."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB85","doi-asserted-by":"crossref","unstructured":"H.E. Scarf, Production sets with indivisibilities\u2014Part I: Generalities, Econometrica 49 (1981) 1\u201332. Part II: The case of two activities, Econometrica 49 (1981) 395\u2013423.","DOI":"10.2307\/1913318"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB86","doi-asserted-by":"crossref","first-page":"507","DOI":"10.2307\/1911306","article-title":"Neighborhood systems for production sets with indivisibilities","volume":"54","author":"Scarf","year":"1986","journal-title":"Econometrica"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB87","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","article-title":"A hierarchy of polynomial time lattice basis reduction algorithms","volume":"53","author":"Schnorr","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB88","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1017\/S0963548300001371","article-title":"Block reduced lattice bases and successive minima","volume":"3","author":"Schnorr","year":"1994","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB89","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01581144","article-title":"Lattice basis reduction: improved practical algorithms and solving subset sum problems","volume":"66","author":"Schnorr","year":"1994","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB90","series-title":"Advances in Cryptology\u2014EUROCRYPT \u201995","first-page":"1","article-title":"Attacking the Chor\u2013Rivest cryptosystem by improved lattice reduction","volume":"Vol. 921","author":"Schnorr","year":"1995"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB91","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB92","doi-asserted-by":"crossref","unstructured":"A.S. Schulz, R. Weismantel, G. Ziegler, 0\/1 integer programming: optimization and augmentation are equivalent, in: Lecture Notes in Computer Science, Vol. 979, Springer, Berlin, 1995, pp. 473\u2013483.","DOI":"10.1007\/3-540-60313-1_164"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB93","unstructured":"A. Schulz, R. Weismantel, An oracle-polynomial time augmentation algorithm for integer programming, in Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, Baltimore, USA, 1999, pp. 967\u2013968."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB94","unstructured":"A. Seb\u00f6, Hilbert bases, Carath\u00e9odory's theorem and combinatorial optimization, in Proceedings of the IPCO Conference, Waterloo, Canada, 1990, pp. 431\u2013455."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB95","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BF01202355","article-title":"Simultaneous reduction of a lattice basis and its reciprocal basis","volume":"13","author":"Seysen","year":"1993","journal-title":"Combinatorica"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB96","unstructured":"V. Shoup, NTL: A Library for doing Number Theory, Department of Computer Science, University of Wisconsin-Madison. http:\/\/www.shoup.net\/."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB97","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1098\/rstl.1861.0016","article-title":"On systems of indeterminate equations and congruences","volume":"151","author":"Smith","year":"1861","journal-title":"Philosophical Transactions of the Royal Society of London (A)"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB98","series-title":"Gr\u00f6bner Bases and Convex Polytopes","volume":"Vol. 8","author":"Sturmfels","year":"1996"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB99","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF02614622","article-title":"Variation of cost functions in integer programming","volume":"77","author":"Sturmfels","year":"1997","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB100","first-page":"281","article-title":"Gr\u00f6bner bases of lattices, corner polyhedra and integer programming","volume":"36","author":"Sturmfels","year":"1995","journal-title":"Beitr\u00e4ge zur Geometrie und Algebra"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB101","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1287\/moor.20.4.864","article-title":"A geometric Buchberger algorithm for integer programming","volume":"20","author":"Thomas","year":"1995","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB102","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s002000050062","article-title":"Truncated Gr\u00f6bner bases for integer programming","volume":"8","author":"Thomas","year":"1997","journal-title":"Appl. Algeb. Eng. Commun. Comput."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB103","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1137\/S0895480195281209","article-title":"A variant of Buchberger's algorithm for integer programming","volume":"1","author":"Urbaniak","year":"1997","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB104","unstructured":"C. Wallacher, Kombinatorische Algorithmen f\u00fcr Flu\u00dfprobleme und submodulare Flu\u00dfprobleme, Ph.D. Thesis, Technische Universit\u00e4t zu Braunschweig, 1992."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB105","unstructured":"X. Wang, A new implementation of the generalized basis reduction algorithm for convex integer programming, Ph.D. Thesis, Yale University, 1997."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB106","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/BF01584662","article-title":"Generalized dynamic programming methods in integer programming","volume":"4","author":"Wolsey","year":"1973","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB107","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0166-218X(81)90016-0","article-title":"On the b-hull of an integer program","volume":"3","author":"Wolsey","year":"1981","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00337-7_BIB108","article-title":"A primal (all integer), integer programming algorithm","volume":"69b","author":"Young","year":"1965","journal-title":"J. Res. Nat. Bureau Standards"},{"key":"10.1016\/S0166-218X(01)00337-7_BIB109","doi-asserted-by":"crossref","unstructured":"R.D. Young, A simplified primal (all integer) integer programming algorithm, Oper. Res. 16 (1968) 750\u2013782, 213\u2013250.","DOI":"10.1287\/opre.16.4.750"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01003377?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01003377?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T03:50:43Z","timestamp":1733716243000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01003377"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":109,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S0166218X01003377"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00337-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}