{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T12:33:38Z","timestamp":1768912418212,"version":"3.49.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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":[[1994,1]]},"DOI":"10.1007\/bf01582058","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:37:34Z","timestamp":1114677454000},"page":"47-64","source":"Crossref","is-referenced-by-count":18,"title":["Efficient enumeration of the vertices of polyhedra associated with network LP's"],"prefix":"10.1007","volume":"63","author":[{"given":"J. Scott","family":"Provan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"A.V. Aho, J.E. Hopcroft and J.D. Ullman,The Design and Analysis of Computer Algorithms (Addison-Wesley, New York, 1974)."},{"key":"CR2","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\u2013193.","journal-title":"Computing"},{"key":"CR3","volume-title":"\u201cA pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra,\u201d Tech. Rept. SOCS-91.6","author":"D. Avis","year":"1991","unstructured":"D. Avis and K. Fukuda, \u201cA pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra,\u201d Tech. Rept. SOCS-91.6, McGill University (Montr\u00e9al, Qu\u00e9., 1991)."},{"key":"CR4","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":"CR5","doi-asserted-by":"crossref","unstructured":"B. Chazelle, \u201cAn optimal convex hull algorithm and new results on cuttings (extended abstract),\u201dProceedings of 32nd IEEE FCOS (1991) 29\u201338.","DOI":"10.1109\/SFCS.1991.185345"},{"key":"CR6","volume-title":"Linear Programming and Network Flows","author":"M.S. Bazaraa","year":"1977","unstructured":"M.S. Bazaraa and J.J. Jarvis,Linear Programming and Network Flows (Wiley, New York, 1977)."},{"key":"CR7","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":"CR8","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":"CR9","first-page":"53","volume-title":"Linear Inequalities and Related Systems","author":"A.J. Goldman","year":"1956","unstructured":"A.J. Goldman, \u201cResolution and separation theorems for polyhedral convex sets,\u201d in: H.W. Kuhn and A.W. Tucker, eds.,Linear Inequalities and Related Systems (Princeton University Press, Princeton, NJ, 1956) pp. 53\u201397."},{"key":"CR10","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E.L. Lawler","year":"1976","unstructured":"E.L. Lawler,Combinatorial Optimization: Networks and Matroids (Holt, Rinehart and Winston, San Francisco, CA, 1976)."},{"key":"CR11","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":"CR12","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1287\/opre.21.1.247","volume":"21","author":"T.H. Matthiess","year":"1973","unstructured":"T.H. Matthiess, \u201cAn algorithm for determining irrelevant constraints and all vertices in systems of linear inequalities,\u201dOperations Research 21 (1973) 247\u2013260.","journal-title":"Operations Research"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"T.H. Matthiess and D.S. Rubin, \u201cA survey and comparison of methods for finding all vertices of convex polyhedral sets,\u201dMathematics of Operations Research (1980) 167\u2013185.","DOI":"10.1287\/moor.5.2.167"},{"key":"CR14","first-page":"51","volume-title":"Contributions to the Theory of Games, Vol. 2","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. 2 (Princeton University Press, Princeton, NJ, 1953) pp. 51\u201373."},{"key":"CR15","volume-title":"Linear Programming","author":"K.G. Murty","year":"1983","unstructured":"K.G. Murty,Linear Programming (Wiley, New York, 1983)."},{"key":"CR16","first-page":"122","volume-title":"Applications of Discrete Mathematics","author":"J.S. Provan","year":"1988","unstructured":"J.S. Provan, \u201cEfficient recognition of matroid and 2-monotonic systems,\u201d in: R.D. Ringeisen and F.S. Roberts, eds.,Applications of Discrete Mathematics (SIAM, Philadelphia, PA, 1988) pp. 122\u2013134."},{"key":"CR17","volume-title":"\u201cA paradigm for listing (s, t)-cuts in graphs,\u201d Tech. Rept. UNC\/OR\/TR91-3","author":"J.S. Provan","year":"1991","unstructured":"J.S. Provan and D.R. Shier, \u201cA paradigm for listing (s, t)-cuts in graphs,\u201d Tech. Rept. UNC\/OR\/TR91-3, University of North Carolina (Chapel Hill, NC, 1991)."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/net.1975.5.3.237","volume":"5","author":"R.C. Read","year":"1975","unstructured":"R.C. Read and R.E. Tarjan, \u201cBounds on backtrack algorithms for listing cycles, paths and spanning trees,\u201dNetworks 5 (1975) 237\u2013252.","journal-title":"Networks"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1287\/opre.23.3.555","volume":"23","author":"D.S. Rubin","year":"1975","unstructured":"D.S. Rubin, \u201cVertex generation and cardinality constrained linear programs,\u201dOperations Research 23 (1975) 555\u2013564.","journal-title":"Operations Research"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/S0167-5060(08)70752-0","volume":"1","author":"D.S. Rubin","year":"1977","unstructured":"D.S. Rubin, \u201cVertex generation methods for problems with logical constraints,\u201dAnnals of Discrete Mathematics 1 (1977) 457\u2013466.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"R. Seidel, \u201cConstructing higher-dimensional convex hulls at logarithmic cost per face,\u201dProceedings of the 18th ACM STOC (1986) 404\u2013413.","DOI":"10.1145\/12130.12172"},{"key":"CR22","first-page":"17","volume":"6","author":"G. Swart","year":"1985","unstructured":"G. Swart, \u201cFinding the convex hull facet by facet,\u201dJournal of Algebra 6 (1985) 17\u201348.","journal-title":"Journal of Algebra"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582058.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582058\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582058","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,3]],"date-time":"2023-05-03T02:33:00Z","timestamp":1683081180000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582058"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":22,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["BF01582058"],"URL":"https:\/\/doi.org\/10.1007\/bf01582058","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}