{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:31:11Z","timestamp":1725568271437},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671817"},{"type":"electronic","value":"9783540465157"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/978-3-540-46515-7_4","type":"book-chapter","created":{"date-parts":[[2010,10,20]],"date-time":"2010-10-20T13:35:28Z","timestamp":1287581728000},"page":"47-56","source":"Crossref","is-referenced-by-count":6,"title":["Living with lrs"],"prefix":"10.1007","author":[{"given":"David","family":"Avis","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF02293050","volume":"8","author":"D. Avis","year":"1992","unstructured":"Avis, D., Fukuda, K.: A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra. Discrete and Computational Geometry\u00a08, 295\u2013313 (1992)","journal-title":"Discrete and Computational Geometry"},{"unstructured":"Avis, D., Devroye, L.: Estimating the Number of Vertices of a Polyhedron. In: Avis, D., Bose, P. (eds.) Snapshots of Computational and Discrete Geometry, McGill University. School of Computer Science, vol.\u00a03, pp. 179\u2013190 (1994), ftp:\/\/mutt.cs.mcgill.ca\/pub\/doc\/avis\/AD94a.ps.gz","key":"4_CR2"},{"unstructured":"Avis, D.: A C Implementation of the Reverse Search Vertex Enumeration Algorithm. In: Imai, H. (ed.) RIMS Kokyuroku 872, Kyoto University (May 1994), ftp:\/\/mutt.cs.mcgill.ca\/pub\/doc\/avis\/Av94a.ps.gz","key":"4_CR3"},{"key":"4_CR4","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0925-7721(96)00023-5","volume":"7","author":"D. Avis","year":"1997","unstructured":"Avis, D., Bremner, D., Seidel, R.: How Good are Convex Hull Algorithms? Computational Geometry: Theory and Applications\u00a07, 265\u2013301 (1997)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1080\/10556789808805706","volume":"10","author":"D. Avis","year":"1998","unstructured":"Avis, D.: Computational Experience with the Reverse Search Vertex Enumeration Algorithm. Optimization Methods and Software\u00a010, 107\u2013124 (1998)","journal-title":"Optimization Methods and Software"},{"doi-asserted-by":"crossref","unstructured":"Avis, D.: Irs: A Revised Implementation of the Reverse Search Vertex Enumeration Algorithm (May 1998), ftp:\/\/mutt.cs.mcgill.ca\/pub\/doc\/avis\/Av98a.ps.gz","key":"4_CR6","DOI":"10.1080\/10556789808805706"},{"unstructured":"Brllngger, A., Marzetta, A., Fukuda, K., Nievergelt, J.: The Parallel Search Bench ZRAM and its Applications (1997), ftp:\/\/ftp.ifor.math.ethz.ch\/pub\/fukuda\/reports","key":"4_CR7"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1103\/PhysRevB.49.1","volume":"49","author":"G. Ceder","year":"1994","unstructured":"Ceder, G., Garbulsky, G.D., Avis, D., Fukuda, K.: Ground States of a Ternary Lattice Model with Nearest and Next-Nearest Neighbor Interactions. Physical Review B\u00a049, 1\u20137 (1994)","journal-title":"Physical Review B"},{"unstructured":"Chvatal, V.: Linear Programming. W.H. Freeman, New York (1983)","key":"4_CR9"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF01263604","volume":"52","author":"A. Deza","year":"1994","unstructured":"Deza, A., Fukuda, K.: McMullen\u2019s Conditions and some Lower Bounds for General Convex Polytopes. Geometriae Dedicata\u00a052, 165\u2013173 (1994)","journal-title":"Geometriae Dedicata"},{"key":"4_CR11","volume-title":"Order and Phase Stability in Alloys","author":"F. Ducastelle","year":"1991","unstructured":"Ducastelle, F.: Order and Phase Stability in Alloys. North-Holland, Amsterdam (1991)"},{"key":"4_CR12","first-page":"203","volume":"31","author":"J. Edmonds","year":"1997","unstructured":"Edmonds, J., Maurras, J.-F.: Note sur les Q-matrices d\u2019Edmonds. Recherche Operationelle (RAIRO)\u00a031, 203\u2013209 (1997)","journal-title":"Recherche Operationelle (RAIRO)"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.2307\/2313307","volume":"72","author":"M. Hall","year":"1965","unstructured":"Hall, M., Knuth, D.E.: Combinatorial Analysis and Computers. Am. Math. Monthly\u00a072, 21\u201328 (1965)","journal-title":"Am. Math. Monthly"},{"key":"4_CR14","volume-title":"Linear Programming","author":"J. Ignizio","year":"1994","unstructured":"Ignizio, J., Cavalier, T.: Linear Programming. Prentice Hall, Englewood Cliffs (1994)"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1143\/PTP.54.30","volume":"54","author":"M. Kaburagi","year":"1975","unstructured":"Kaburagi, M., Kanamori, J.: A Method of Determining the Ground State of the Extended Range Classical Lattice Gas Model. Progress in Theoretical Physics\u00a054, 30\u201344 (1975)","journal-title":"Progress in Theoretical Physics"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02392139","volume":"CXXXIII","author":"V. Klee","year":"1974","unstructured":"Klee, V.: Polytope Pairs and Their Relationship to Linear Programming. Acta Math.\u00a0CXXXIII, 1\u201325 (1974)","journal-title":"Acta Math."},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1287\/opre.21.1.247","volume":"21","author":"T.H. Matheiss","year":"1973","unstructured":"Matheiss, T.H.: An Algorithm for Determining Irrelevant Constraints and All Vertices in Systems of Linear Inequlaties. Operations Research\u00a021, 247\u2013260 (1973)","journal-title":"Operations Research"},{"key":"4_CR18","volume-title":"Lectures on Polytopes","author":"G. Ziegler","year":"1994","unstructured":"Ziegler, G.: Lectures on Polytopes. Springer, Heidelberg (1994); revised. Graduate Texts in Mathematics (1998)"}],"container-title":["Lecture Notes in Computer Science","Discrete and Computational Geometry"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-46515-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,12]],"date-time":"2021-11-12T04:17:03Z","timestamp":1636690623000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-46515-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671817","9783540465157"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-46515-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}