{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T10:12:46Z","timestamp":1648721566946},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Methods of Operations Research"],"published-print":{"date-parts":[[1998,2]]},"DOI":"10.1007\/bf01193834","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T10:56:54Z","timestamp":1108724214000},"page":"1-37","source":"Crossref","is-referenced-by-count":7,"title":["Test sets of integer programs"],"prefix":"10.1007","volume":"47","author":[{"given":"Robert","family":"Weismantel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Network flows: Theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: Theory, algorithms, and applications. Prentice Hall, Englewood Cliffs NJ"},{"key":"CR2","unstructured":"B\ufffdr\ufffdny I, Howe R, Scarf H (1993) The complex of maximal lattice free simplices, Proc. of the IPCO conference Erice, Italy, pp. 1?10"},{"key":"CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0913-3","volume-title":"Gr\ufffdbner bases: A computational approach to commutative algebra","author":"T Becker","year":"1993","unstructured":"Becker T, Weispfenning V (1993) Gr\ufffdbner bases: A computational approach to commutative algebra. Springer Verlag, New York"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"Buchberger B (1985) Gr\ufffdbner bases: An algorithmic method in polynomial ideal theory. In: Bose NK (ed.) Multidimensional systems theory, D. Reidel Publications, pp. 184?232","DOI":"10.1007\/978-94-009-5225-6_6"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"Conti P, Traverso C (1991) Buchberger algorithm and integer programming. Proceedings AAECC-9 (New Orleans), Springer LNCS 539, pp. 130?139","DOI":"10.1007\/3-540-54522-0_102"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0095-8956(86)90064-X","volume":"40","author":"W Cook","year":"1986","unstructured":"Cook W, Fonlupt J, Schrijver A (1986) An integer analogue of Caratheodory's theorem. J. Comb. Theory (B) 40:63?70","journal-title":"J. Comb. Theory (B)"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Cornuejols G, Urbaniak R, Weismantel R, Wolsey L (1997) Decomposition of integer programs and of generating sets. LNCS 1284, Burkard R, Woeginger G (eds.), Springer, pp. 92?103","DOI":"10.1007\/3-540-63397-9_8"},{"key":"CR8","first-page":"368","volume":"34","author":"JG Corput van der","year":"1931","unstructured":"van der Corput JG (1931) \ufffdber Systeme von linear-homogenen Gleichungen und Ungleichungen. Proceedings Koninklijke Akademie van Wetenschappen te Amsterdam 34:368?371","journal-title":"Proceedings Koninklijke Akademie van Wetenschappen te Amsterdam"},{"key":"CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2181-2","volume-title":"Ideals, varieties, and algorithms: An introduction to computational algebraic geometry and commutative algebra","author":"DA Cox","year":"1992","unstructured":"Cox DA, Little JB, O'Shea D (1992) Ideals, varieties, and algorithms: An introduction to computational algebraic geometry and commutative algebra. Springer-Verlag, New York"},{"key":"CR10","unstructured":"Diaconis P, Graham RL, Sturmfels B (1995) Primitive partition identities. Working Paper"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds J, Karp RM (1972) Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the Association for Computing Machinery 19:248?264","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR12","volume-title":"Matroids in combinatorial optimization. In: White N Combinatorial geometries","author":"U Faigle","year":"1987","unstructured":"Faigle U (1987) Matroids in combinatorial optimization. In: White N Combinatorial geometries, Cambridge University Press, Cambridge"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF02579200","volume":"7","author":"A Frank","year":"1987","unstructured":"Frank A, Tardos E (1987) An application of simultaneous diophantine approximation in combinatorial optimization. Combinatorica 7:49?65","journal-title":"Combinatorica"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/0022-0000(85)90039-X","volume":"31","author":"HN Gabow","year":"1985","unstructured":"Gabow HN (1985) Scaling algorithms for network problems. Journal of Computer and System Sciences 31:148?168","journal-title":"Journal of Computer and System Sciences"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0024-3795(79)90018-1","volume":"25","author":"FR Giles","year":"1979","unstructured":"Giles FR, Pulleyblank WR (1979) Total dual integrality and integer polyhedra. Lineare Algebra Appl. 25:191?196","journal-title":"Lineare Algebra Appl."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF01442864","volume":"6","author":"P Gordan","year":"1873","unstructured":"Gordan P (1873) \ufffdber die Aufl\ufffdsung linearer Gleichungen mit reellen Coefficienten. Math. Ann. 6:23?28","journal-title":"Math. Ann."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01681344","volume":"8","author":"JE Graver","year":"1975","unstructured":"Graver JE (1975) On the foundations of linear and integer programming I. Mathematical Programming 8:207?226","journal-title":"Mathematical Programming"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1016\/B978-0-444-89597-4.50006-8","volume-title":"Handbook of convex geometry, Volume B","author":"P Gritzmann","year":"1993","unstructured":"Gritzmann P, Wills JM (1993) Lattice points. In: Gruber PM, Wills JM (eds.) Handbook of convex geometry, Volume B, North-Holland, Amsterdam, pp. 765?798"},{"key":"CR19","volume-title":"Handbook of combinatorics","author":"M Gr\ufffdtschel","year":"1995","unstructured":"Gr\ufffdtschel M, Lov\ufffdsz L (1995) Combinatorial optimization. In: Graham R, Gr\ufffdtschel M, Lov\ufffdsz L (eds.) Handbook of combinatorics, North-Holland, Amsterdam"},{"key":"CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometrie algorithms and combinatorial optimization","author":"M Gr\ufffdtschel","year":"1988","unstructured":"Gr\ufffdtschel M, Lov\ufffdsz L, Schrijver A (1988) Geometrie algorithms and combinatorial optimization. Springer-Verlag, Berlin"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/3-540-59408-6_57","volume-title":"Integer programming and combinatorial optimization, Lecture notes in Computer Science 920","author":"S Hosten","year":"1995","unstructured":"Hosten S, Sturmfels B (1995) GRIN: An implementation of Gr\ufffdbner bases for integer programming. In: Balas E, Clausen J (eds.) Integer programming and combinatorial optimization, Lecture notes in Computer Science 920, Springer-Verlag, Berlin, pp. 267?276"},{"key":"CR22","unstructured":"Henk M, Weismantel R (1996) On Hubert bases of polyhedral cones. Konrad-Zuse-Zentrum f\ufffdr Informationstechnik Berlin, Preprint SC 96-12"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R Kannan","year":"1987","unstructured":"Kannan R (1987) Minkowski's convex body theorem and integer programming. Math. Oper. Res. 12:415?440","journal-title":"Math. Oper. Res."},{"key":"CR24","doi-asserted-by":"crossref","first-page":"577","DOI":"10.2307\/1971436","volume":"128","author":"R Kannan","year":"1988","unstructured":"Kannan R, Lov\ufffdsz L (1988) Covering minima and lattice point free convx bodies. Ann. Math. 128:577?602","journal-title":"Ann. Math."},{"key":"CR25","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1287\/moor.15.2.364","volume":"15","author":"R Kannan","year":"1990","unstructured":"Kannan R, Lov\ufffdsz L, Scarf H (1990) The shapes of polyhedra. Math. Oper. Res. 15:364?380","journal-title":"Math. Oper. Res."},{"key":"CR26","volume-title":"Handbook of combinatorics","author":"JC Lagarias","year":"1995","unstructured":"Lagarias JC (1995) Point lattices. In: Graham R, Gr\ufffdtschel M, Lov\ufffdsz L (eds.) Handbook of combinatorics, North-Holland, Amsterdam"},{"key":"CR27","unstructured":"Liu J (1991) Hubert bases with the carath\ufffdodory property. PhD. Dissertation, Cornell University"},{"key":"CR28","unstructured":"Lov\ufffdsz L (1989) Geometry of numbers and integer programming. In: hi M, Tanabe K (eds.) Proc. of the 13th International Symposium on Mathematical Programming, Mathematical Programming: 177?201"},{"key":"CR29","unstructured":"Moulinet C, Pottier L Gr\ufffdbner bases of toric ideals: Properties, algorithms and applications. Preprint INRIA Sophia Antipolis"},{"key":"CR30","doi-asserted-by":"crossref","unstructured":"Pottier L (1991) Minimal solutions of linear diophantine systems: bounds and algorithms. Proceedings RTA (Como), Springer Verlag, LNCS 488","DOI":"10.1007\/3-540-53904-2_94"},{"key":"CR31","first-page":"181","volume-title":"Discrete Structures and Algorithms","author":"H R\ufffdck","year":"1980","unstructured":"R\ufffdck H (1980) Scaling techniques for minimal cost network flows. Discrete Structures and Algorithms, Carl Hanser, M\ufffdnchen, pp. 181?191"},{"key":"CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/1911124","volume":"49","author":"HE Scarf","year":"1981","unstructured":"Scarf HE (1981) Production sets with indivisibilities, Part I: Generalities. Econometrica 49:1?32","journal-title":"Econometrica"},{"key":"CR33","doi-asserted-by":"crossref","first-page":"507","DOI":"10.2307\/1911306","volume":"54","author":"HE Scarf","year":"1986","unstructured":"Scarf HE (1986) Neighborhood systems for production sets with indivisibilities. Econometrica 54:507?532","journal-title":"Econometrica"},{"key":"CR34","volume-title":"Theory of linear and integer programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver A (1986) Theory of linear and integer programming. Wiley Chichester"},{"key":"CR35","doi-asserted-by":"crossref","unstructured":"Schulz A, Weismantel R, Ziegler G (1995) 0\/1 integer programming: Optimization and augmentation are equivalent. In: Spirakis P (ed.) Proceedings of the European Symposium on Algorithms, Lecture Notes in Computer Science, Springer-Verlag","DOI":"10.1007\/3-540-60313-1_164"},{"key":"CR36","unstructured":"Seb\ufffd A (1990) Hubert bases, Caratheodory's Theorem and combinatorial optimization. In: Proc. of the IPCO conference, Waterloo, Canada, pp. 431?455"},{"key":"CR37","volume-title":"Gr\ufffdbner bases and convex polytopes","author":"B Sturmfels","year":"1996","unstructured":"Sturmfels B (1996) Gr\ufffdbner bases and convex polytopes. American Mathematical Society, Providence"},{"key":"CR38","unstructured":"Sturmfels B, Thomas R (1994) Variation of cost functions in integer programming. Manuscript (1994), Mathematical Programming, to appear"},{"key":"CR39","first-page":"281","volume":"36","author":"B Sturmfels","year":"1995","unstructured":"Sturmfels B, Weismantel R, Ziegler G (1995) Gr\ufffdbner bases of lattices, corner polyhedra and integer programming. Beitr\" age zur Geometrie und Algebra 36:281?298","journal-title":"Beitr\" age zur Geometrie und Algebra"},{"issue":"4","key":"CR40","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1287\/moor.20.4.864","volume":"20","author":"R Thomas","year":"1995","unstructured":"Thomas R (1995) A geometric Buchberger algorithm for integer programming. Math. Oper. Res. 20, 4:864?884","journal-title":"Math. Oper. Res."},{"key":"CR41","unstructured":"Thomas R (1994) Gr\ufffdbner basis methods for integer programming. PhD. Dissertation, Cornell University"},{"key":"CR42","first-page":"241","volume":"4","author":"R Thomas","year":"1995","unstructured":"Thomas R, Weismantel R (1995) Truncated Gr\ufffdbner bases for integer programming. Applicable Algebra in Engineering, Communication and Computing 8, 4:241?257","journal-title":"Communication and Computing 8"},{"key":"CR43","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1137\/S0895480195281209","volume":"10","author":"R Urbaniak","year":"1994","unstructured":"Urbaniak R, Weismantel R, Ziegler G (1994) A variant of Buchberger's algorighm for integer programming. SIAM Journal on Discrete Mathematics 1, 10:96?108","journal-title":"SIAM Journal on Discrete Mathematics 1"},{"key":"CR44","volume-title":"Matroid theory","author":"DJA Welsh","year":"1976","unstructured":"Welsh DJA (1976) Matroid theory. Academic Press London"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01193834.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01193834\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01193834","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:51:00Z","timestamp":1586119860000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01193834"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["BF01193834"],"URL":"https:\/\/doi.org\/10.1007\/bf01193834","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}