{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T16:40:57Z","timestamp":1768927257621,"version":"3.49.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1977,12,1]],"date-time":"1977-12-01T00:00:00Z","timestamp":249782400000},"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":[[1977,12]]},"DOI":"10.1007\/bf01593771","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T20:13:01Z","timestamp":1114719181000},"page":"81-96","source":"Crossref","is-referenced-by-count":71,"title":["An algorithm for determining all extreme points of a convex polytope"],"prefix":"10.1007","volume":"12","author":[{"given":"M. E.","family":"Dyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L. G.","family":"Proll","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"M.L. Balinski, \u201cAn algorithm for finding all vertices of convex polyhedral sets\u201d,Journal of the Society Industrial and Applied Mathematics (1961) 72\u201388.","DOI":"10.1137\/0109008"},{"key":"CR2","volume-title":"The theory of graphs and its applications","author":"C. Berge","year":"1962","unstructured":"C. Berge,The theory of graphs and its applications (Methuen, London, 1962)."},{"key":"CR3","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\u201d,SIAM Journal on Applied Mathematics, 26 (1974) 479\u2013489.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/opre.18.1.82","volume":"18","author":"V.A. Cabot","year":"1970","unstructured":"V.A. Cabot and R.L. Francis, \u201cSolving certain nonconvex quadratic minimization problems by ranking the extreme points\u201d,Operations Research, 18 (1970) 82\u201386.","journal-title":"Operations Research"},{"key":"CR5","volume-title":"An introduction to linear programming","author":"A. Charnes","year":"1953","unstructured":"A. Charnes, W.W. Cooper and A. Henderson,An introduction to linear programming (Wiley; New York, 1953)."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0041-5553(65)90045-5","volume":"5","author":"N.V. Chernikova","year":"1965","unstructured":"N.V. Chernikova, \u201cAn algorithm for finding a general formula for non-negative solutions of a system of linear inequalities\u201d,U.S.S.R. Computational Mathematics and Mathematical Physics 5 (1965) 228\u2013233.","journal-title":"U.S.S.R. Computational Mathematics and Mathematical Physics"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01437214","volume":"24","author":"H. Greenberg","year":"1975","unstructured":"H. Greenberg, \u201cAn algorithm for determining redundant inequalities and all solutions to polyhedra\u201d,Numerische Mathematik, 24 (1975) 19\u201326.","journal-title":"Numerische Mathematik"},{"key":"CR8","volume-title":"Convex polytopes","author":"B. Grunbaum","year":"1967","unstructured":"B. Grunbaum,Convex polytopes (Wiley, New York, 1967)."},{"key":"CR9","volume-title":"Linear programming","author":"G. Hadley","year":"1962","unstructured":"G. Hadley,Linear programming (Addison-Wesley, Reading, MA, 1962)."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1287\/mnsc.18.9.540","volume":"18","author":"M.J.L. Kirby","year":"1972","unstructured":"M.J.L. Kirby, H.L. Love and Kanti Swarup, \u201cExtreme point mathematical programming\u201d,Management Science, 18 (1972) 540\u2013549.","journal-title":"Management Science"},{"key":"CR11","volume-title":"The art of computer programming, Vol. 2:Seminumerical algorithms","author":"D.E. Knuth","year":"1968","unstructured":"D.E. Knuth,The art of computer programming, Vol. 2:Seminumerical algorithms (Addison-Wesley, Reading, MA, 1968)."},{"key":"CR12","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\u201d,Numerische Mathematik, 12 (1968) 226\u2013229.","journal-title":"Numerische Mathematik"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1287\/opre.21.1.247","volume":"21","author":"T.H. Mattheis","year":"1973","unstructured":"T.H. Mattheis, \u201cAn algorithm for determining irrelevant constraints and all vertices in systems of linear inequalities\u201d,Operations Research 21 (1973) 247\u2013260.","journal-title":"Operations Research"},{"key":"CR14","volume-title":"Contributions to the theory of games, Vol. 2","author":"T.S. Motzkin","year":"1973","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, RI, 1973)."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1287\/opre.16.2.268","volume":"16","author":"K.G. Murty","year":"1968","unstructured":"K.G. Murty, \u201cSolving the fixed charge problem by ranking the extreme points\u201d,Operations Research 16 (1968) 268\u2013279.","journal-title":"Operations Research"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1287\/opre.16.3.682","volume":"16","author":"K.G. Murty","year":"1969","unstructured":"K.G. Murty, \u201cAn algorithm for ranking all the assignments in increasing order of costs\u201d,Operations Research 16 (1969) 682\u2013687.","journal-title":"Operations Research"},{"key":"CR17","unstructured":"M.A. Pollatschek and B. Avi-Itshak, \u201cSorting feasible basic solutions of a linear program\u201d, presented at the 3rd Annual Israel Conference on Operations Research (1969)."},{"key":"CR18","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\u201d,Operations Research 23 (1975) 555\u2013564.","journal-title":"Operations Research"},{"key":"CR19","unstructured":"G.J. Silverman, \u201cComputational considerations in extreme point enumeration\u201d. IBM Los Angeles Scientific Center, Report G320-2649 (1971)."},{"key":"CR20","volume-title":"Applications of mathematical programming techniques","author":"W.J. Sullivan","year":"1970","unstructured":"W.J. Sullivan and E. Koenigsberg, \u201cMixed integer programming applied to ship allocation\u201d, in: E.M.L. Beale, ed.,Applications of mathematical programming techniques, (English Universities' Press, London, 1970)."},{"key":"CR21","volume-title":"Studies in linear and nonlinear programming","author":"H. Uzawa","year":"1958","unstructured":"H. Uzawa, \u201cA theorem on convex polyhedral cones\u201d, in: Arrow, Hurwicz and Uzawa, eds.,Studies in linear and nonlinear programming, (Standford University Press, Stanford, CA, 1958)."},{"key":"CR22","unstructured":"S. Vajda, \u201cManpower planning and mathematical programming\u201d, paper presented at the Operational Research Society annual conference, Brighton (1974)."},{"key":"CR23","doi-asserted-by":"crossref","first-page":"1014","DOI":"10.1287\/mnsc.21.9.1014","volume":"21","author":"C. Panne Van De","year":"1975","unstructured":"C. Van De Panne, \u201cA node method for multiparametric linear programming\u201d,Management Science 21 (1975) 1014\u20131020.","journal-title":"Management Science"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01593771.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01593771\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01593771","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:48:02Z","timestamp":1556898482000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01593771"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,12]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1977,12]]}},"alternative-id":["BF01593771"],"URL":"https:\/\/doi.org\/10.1007\/bf01593771","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1977,12]]}}}