{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T02:28:47Z","timestamp":1680316127812},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1995,10,1]],"date-time":"1995-10-01T00:00:00Z","timestamp":812505600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1995,10]]},"DOI":"10.1007\/bf01585927","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T05:15:15Z","timestamp":1114665315000},"page":"27-45","source":"Crossref","is-referenced-by-count":5,"title":["Segments in enumerating faces"],"prefix":"10.1007","volume":"70","author":[{"given":"Katta G.","family":"Murty","sequence":"first","affiliation":[]},{"given":"Sung-Jin","family":"Chung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF02242366","volume":"15","author":"W. Altherr","year":"1975","unstructured":"W. Altherr, \u201cAn algorithm for enumerating all vertices of a convex polyhedron,\u201dComputing 15 (1975) 181\u2013183.","journal-title":"Computing"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF02293050","volume":"8","author":"D. Avis","year":"1992","unstructured":"D. Avis and K. Fukuda, \u201cA pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra,\u201dDiscrete and Computational Geometry 8 (1992) 295\u2013313.","journal-title":"Discrete and Computational Geometry"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1137\/0109008","volume":"9","author":"M.L. Balinski","year":"1961","unstructured":"M.L. Balinski, \u201cAn algorithm for finding all vertices of convex polyhedral sets,\u201dSIAM Journal on Applied Mathematics 9 (1961) 72\u201388.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1137\/0126045","volume":"26","author":"C.A. Burdet","year":"1974","unstructured":"C.A. Burdet, \u201cGenerating all the faces of a polyhedron,\u201dSIAM Journal on Applied Mathematics 26 (1974) 479\u2013489.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1287\/moor.8.3.381","volume":"8","author":"M.E. Dyer","year":"1983","unstructured":"M.E. Dyer, \u201cThe complexity of vertex enumeration methods,\u201dMathematics of Operations Research 8 (1983) 381\u2013402.","journal-title":"Mathematics of Operations Research"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01593771","volume":"12","author":"M.E. Dyer","year":"1977","unstructured":"M.E. Dyer and L.G. Proll, \u201cAn algorithm for determining all extreme points of a convex polytope,\u201dMathematical Programming 12 (1977) 81\u201396.","journal-title":"Mathematical Programming"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01582241","volume":"33","author":"R. Freund","year":"1985","unstructured":"R. Freund and J. Orlin, \u201cOn the complexity of four polyhedral containment problems,\u201dMathematical Programming 33 (1985) 139\u2013145.","journal-title":"Mathematical Programming"},{"key":"CR8","unstructured":"K. Fukuda and V. Rosta, \u201cCombinatorial face enumeration in convex polytopes,\u201d Research Report 93-1, Graduate School of Systems Management, University of Tsukuba (1993)."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/BF02162916","volume":"12","author":"M. Manas","year":"1968","unstructured":"M. Manas and J. Nedoma, \u201cFinding all vertices of a convex polyhedron,\u201dNumerische Mathematik 12 (1968) 226\u2013229.","journal-title":"Numerische Mathematik"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1287\/moor.5.2.167","volume":"5","author":"T.H. Matheiss","year":"1980","unstructured":"T.H. Matheiss and D.S. Rubin, \u201cA survey and comparison of methods for finding all vertices of convex polyhedral sets,\u201dMathematics of Operations Research 5 (1980) 167\u2013185.","journal-title":"Mathematics of Operations Research"},{"key":"CR11","unstructured":"W.D. Morris, Private communication, 1992."},{"key":"CR12","first-page":"81","volume-title":"Contributions to the Theory of Games, Vol. II, Annals of Mathematics Studies 28","author":"T.S. Motzkin","year":"1953","unstructured":"T.S. Motzkin, H. Raiffa, G.L. Thompson and R.M. Thrall, \u201cThe double description method,\u201d in: H.W. Kuhn and A.W. Tucker, eds.,Contributions to the Theory of Games, Vol. II, Annals of Mathematics Studies 28 (Princeton University Press, Princeton, NJ, 1953) pp. 81\u2013103."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1007\/BF01584675","volume":"4","author":"K.G. Murty","year":"1973","unstructured":"K.G. Murty, \u201cThe graph of an abstract polytope,\u201dMathematical Programming 4 (1973) 336\u2013346.","journal-title":"Mathematical Programming"},{"key":"CR14","volume-title":"Linear Programming","author":"K.G. Murty","year":"1983","unstructured":"K.G. Murty,Linear Programming (Wiley, New York, 1983)."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BFb0121052","volume":"24","author":"K.G. Murty","year":"1985","unstructured":"K.G. Murty, \u201cFaces of a polyhedron,\u201dMathematical Programming Study 24 (1985) 219\u2013224.","journal-title":"Mathematical Programming Study"},{"key":"CR16","volume-title":"\u201cEfficient enumeration of the vertices of polyhedra associated with network LPs,\u201d Technical Report","author":"J.S. Provan","year":"1991","unstructured":"J.S. Provan, \u201cEfficient enumeration of the vertices of polyhedra associated with network LPs,\u201d Technical Report, Department of Operations Research, University of North Carolina (Chapel Hill, NC, 1991)."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0196-6774(85)90017-3","volume":"6","author":"G. Swart","year":"1985","unstructured":"G. Swart, \u201cFinding the convex hull facet by facet,\u201dJournal of Algorithms 6 (1985) 17\u201348.","journal-title":"Journal of Algorithms"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585927.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01585927\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585927","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:32:34Z","timestamp":1556883154000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01585927"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,10]]},"references-count":17,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,10]]}},"alternative-id":["BF01585927"],"URL":"https:\/\/doi.org\/10.1007\/bf01585927","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,10]]}}}