{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:04:03Z","timestamp":1725480243397},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405054"},{"type":"electronic","value":"9783540450665"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45066-1_6","type":"book-chapter","created":{"date-parts":[[2007,2,28]],"date-time":"2007-02-28T12:41:13Z","timestamp":1172666473000},"page":"89-96","source":"Crossref","is-referenced-by-count":3,"title":["Listing Vertices of Simple Polyhedra Associated with Dual LI(2) Systems"],"prefix":"10.1007","author":[{"given":"Sammani D.","family":"Abdullahi","sequence":"first","affiliation":[]},{"given":"Martin E.","family":"Dyer","sequence":"additional","affiliation":[]},{"given":"Les G.","family":"Proll","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"6_CR1","unstructured":"S.D. Abdullahi. Vertex Enumeration and Counting for Certain Classes of Polyhedra. PhD thesis, School of Computing, The University of Leeds, 2002."},{"key":"6_CR2","volume-title":"Data Structures and Algorithms","author":"A.V. Aho","year":"1982","unstructured":"A.V. Aho, J.E. Hopcroft, and J.D. Ullman. Data Structures and Algorithms. Addison-Wesley, Reading, Mass, 1982."},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1137\/0209063","volume":"9","author":"B. Aspvall","year":"1980","unstructured":"B. Aspvall and Y. Shiloach. Polynomial time algorithm for solving systems of linear inequalities with two variables per inequality. SIAM Journal on Computing, 9:827\u2013845, 1980.","journal-title":"SIAM Journal on Computing"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF02293050","volume":"8","author":"D. Avis","year":"1992","unstructured":"D. Avis and K. Fukuda. A pivoting algorithm for convex hulls and vertex enumeration for arrangements and polyhedra. Discrete Computational Geometry, 8:295\u2013313, 1992.","journal-title":"Discrete Computational Geometry"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/0167-6377(91)90042-N","volume":"10","author":"P.-C. Chen","year":"1991","unstructured":"P.-C. Chen, P. Hansen and B. Jaumard. On-line and off-line vertex enumeration by adjacency lists. Operations Research Letters, 10:403\u2013409, 1991.","journal-title":"Operations Research Letters"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1137\/S0097539791256325","volume":"23","author":"E. Cohen","year":"1994","unstructured":"E. Cohen and N. Megiddo. Improved algorithms for linear inequalities with two variables per inequality. SIAM Journal on Computing, 23:1313\u20131347, 1994.","journal-title":"SIAM Journal on Computing"},{"key":"6_CR7","volume-title":"Linear Programming and Extensions","author":"G.B. Dantzig","year":"1963","unstructured":"G.B. Dantzig. Linear Programming and Extensions. Princeton University Press, N.J., 1963."},{"key":"6_CR8","unstructured":"M.E. Dyer. Vertex Enumeration in Mathematical Programming: Methods and Applications. PhD thesis, The University of Leeds, October 1979."},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1287\/moor.8.3.381","volume":"8","author":"M.E. Dyer","year":"1983","unstructured":"M.E. Dyer. The complexity of vertex enumeration methods. Mathematics of Operations Research, 8:381\u2013402, 1983.","journal-title":"Mathematics of Operations Research"},{"key":"6_CR10","first-page":"23","volume-title":"Proceedings of the CP77 Combinatorial Programming Conference","author":"M.E. Dyer","year":"1977","unstructured":"M.E. Dyer and L.G. Proll. Vertex enumeration in convex polyhedra: a comparative computational study. In T. B Boffey, editor, Proceedings of the CP77 Combinatorial Programming Conference, pages 23\u201343, University of Liverpool, Liverpool, 1977."},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF01593771","volume":"12","author":"M.E. Dyer","year":"1977","unstructured":"M.E. Dyer and L.G. Proll. An algorithm for determining all extreme points of a convex polytope. Mathematical Programming, 12:81\u201396, 1977.","journal-title":"Mathematical Programming"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"1179","DOI":"10.1137\/S0097539793251876","volume":"23","author":"D.S. Hochbaum","year":"1994","unstructured":"D.S. Hochbaum and J. Naor. Simple and fast algorithms for linear and integer program with two variables per inequality. SIAM Journal of Computing, 23:1179\u20131192, 1994.","journal-title":"SIAM Journal of Computing"},{"key":"6_CR13","unstructured":"J.L. Kennington and R.V. Helgason. Algorithms for Network Programming. John Wiley and Sons, Inc., 1980."},{"key":"6_CR14","unstructured":"D.E. Knuth. The Art of Computer Programming Vol. 3: Sorting and Searching. Addison-Wesley, 1973."},{"key":"6_CR15","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1287\/moor.5.2.167","volume":"5","author":"T.H. Mattheiss","year":"1980","unstructured":"T.H. Mattheiss and D.S. Rubin. A survey and comparison of methods for finding all vertices of convex polyhedral sets. Mathematics of Operations Research, 5:167\u2013185, 1980.","journal-title":"Mathematics of Operations Research"},{"key":"6_CR16","unstructured":"S.B. Ong, M.E. Dyer, and L.G. Proll. A comparative study of three vertex enumeration algorithms. Technical report, School of Computer Studies, University of Leeds, 1996."},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF01582058","volume":"64","author":"J. Scott Provan","year":"1994","unstructured":"J. Scott Provan. Efficient enumeration of the vertices of polyhedra associated with network LP\u2019s. Mathematical Programming, 64:47\u201364, 1994.","journal-title":"Mathematical Programming"},{"key":"6_CR18","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1145\/322276.322288","volume":"28","author":"R. Shostak","year":"1981","unstructured":"R. Shostak. Deciding linear inequalities by computing loop residues. Journal of the Association for Computing Machinery, 28:769\u2013779, 1981.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"681","DOI":"10.2307\/2322281","volume":"93","author":"H.P. Williams","year":"1986","unstructured":"H.P. Williams. Fourier\u2019s method of linear programming and its dual. American Mathematical Monthly, 93:681\u2013694, 1986.","journal-title":"American Mathematical Monthly"}],"container-title":["Lecture Notes in Computer Science","Discrete Mathematics and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45066-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T03:27:54Z","timestamp":1550287674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45066-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405054","9783540450665"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-45066-1_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}