{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T12:36:56Z","timestamp":1692448616264},"reference-count":25,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1986,1]]},"DOI":"10.1016\/0305-0548(86)90034-1","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"465-475","source":"Crossref","is-referenced-by-count":6,"title":["An extreme-point-ranking algorithm for the extreme-point mathematical programming problem"],"prefix":"10.1016","volume":"13","author":[{"given":"Hanif D.","family":"Sherali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.Elizabeth","family":"Dickey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(86)90034-1_BIB1","volume":"Vol. 1","author":"Charnes","year":"1961"},{"key":"10.1016\/0305-0548(86)90034-1_BIB2","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/nav.3800210206","article-title":"Variations on a cutting plane method for solving concave minimization problems with linear constraints","volume":"21","author":"Cabot","year":"1974","journal-title":"Nav. Res. Logist. Q."},{"key":"10.1016\/0305-0548(86)90034-1_BIB3","first-page":"41","article-title":"Critical path problems under assignment constraints: an application of an extreme-point mathematical programming problem","volume":"1","author":"Chandasekaran","year":"1980","journal-title":"J. Inform. Opt. Sci. (India)"},{"key":"10.1016\/0305-0548(86)90034-1_BIB4","first-page":"14","article-title":"Production scheduling on N identical machines","volume":"8","author":"Kirby","year":"1970","journal-title":"J. Can. Opl Res. Soc."},{"key":"10.1016\/0305-0548(86)90034-1_BIB5","series-title":"Optimization with Disjunctive Constraints","author":"Sherali","year":"1980"},{"key":"10.1016\/0305-0548(86)90034-1_BIB6","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/0377-2217(82)90012-1","article-title":"A classroom\/time assignment model","volume":"9","author":"Mulvey","year":"1982","journal-title":"Eur. J. Opl Res."},{"key":"10.1016\/0305-0548(86)90034-1_BIB7","first-page":"27","article-title":"Cutting plane algorithm for extreme-point mathematical programming","volume":"14","author":"Kirby","year":"1972","journal-title":"Cah. Cent. Etud. Rech. Opl"},{"key":"10.1016\/0305-0548(86)90034-1_BIB8","first-page":"87","article-title":"Strong-cut enumerative procedure for extreme-point mathematical programming problems","volume":"17","author":"Puri","year":"1973","journal-title":"Z. Opl Res."},{"key":"10.1016\/0305-0548(86)90034-1_BIB9","first-page":"257","article-title":"An efficient technique for extreme-point mathematical programming problems","volume":"21","author":"Bakhshi","year":"1979","journal-title":"Cah. Cent. Etud. Rech. Opl"},{"key":"10.1016\/0305-0548(86)90034-1_BIB10","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0166-218X(85)90078-2","article-title":"A branch and bound algorithm for extreme-point mathematical programming problems","volume":"11","author":"Sen","year":"1985","journal-title":"Discrete Appl. Math."},{"issue":"No. 2","key":"10.1016\/0305-0548(86)90034-1_BIB11","first-page":"83","article-title":"A disjunctive cutting plane algorithm for the extreme-point mathematical programming problem","volume":"22","author":"Sherali","year":"1985","journal-title":"Opsearch"},{"key":"10.1016\/0305-0548(86)90034-1_BIB12","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1287\/opre.33.4.928","article-title":"On generating cutting planes from combinatorial disjunctions","volume":"33","author":"Sherali","year":"1985","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(86)90034-1_BIB13","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1287\/opre.21.1.141","article-title":"The generalized lattice point problem","volume":"21","author":"Glover","year":"1973","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(86)90034-1_BIB14","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1287\/opre.21.1.135","article-title":"Concave programming applied to a special class of 0\u20131 integer programs","volume":"21","author":"Glover","year":"1973","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(86)90034-1_BIB15","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/BF02591860","article-title":"On the convergence of cutting-plane algorithms for a class of nonconvex mathematical programs","volume":"31","author":"Sen","year":"1985","journal-title":"Math. Progr."},{"key":"10.1016\/0305-0548(86)90034-1_BIB16","doi-asserted-by":"crossref","first-page":"1260","DOI":"10.1287\/opre.21.6.1260","article-title":"Nonlinear programming: counterexamples to two global optimization algorithms","volume":"21","author":"Zwart","year":"1973","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(86)90034-1_BIB17","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1287\/opre.23.3.565","article-title":"On the generalized lattice point problem and nonlinear programming","volume":"23","author":"Cabot","year":"1975","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(86)90034-1_BIB18","series-title":"Linear Programming","author":"Hadley","year":"1962"},{"key":"10.1016\/0305-0548(86)90034-1_BIB19","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1287\/opre.16.2.268","article-title":"Solving the fixed charge problem by ranking the extreme points","volume":"16","author":"Murty","year":"1968","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(86)90034-1_BIB20","series-title":"Third Annual Israel Conference on Operations Research","article-title":"Sorting feasible basic solutions of a linear program","author":"Pollatschek","year":"1969"},{"key":"10.1016\/0305-0548(86)90034-1_BIB21","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1287\/moor.5.2.167","article-title":"A survey and comparison of methods for finding all vertices of convex polyhedral sets","volume":"5","author":"Mattheiss","year":"1980","journal-title":"Math. Opns Res."},{"key":"10.1016\/0305-0548(86)90034-1_BIB22","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1287\/opre.21.1.247","article-title":"An algorithm for determining irrelevant constraints and all vertices in systems of linear inequalities","volume":"21","author":"Mattheiss","year":"1973","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(86)90034-1_BIB23","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/BF02162916","article-title":"Finding all vertices of a convex polyhedron","volume":"12","author":"Manas","year":"1968","journal-title":"Num. Math."},{"key":"10.1016\/0305-0548(86)90034-1_BIB24","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0041-5553(65)90045-5","article-title":"Algorithms for finding a general formula for the nonnegative solutions of a system of linear inequalities","volume":"5","author":"Chernikova","year":"1965","journal-title":"USSR Comput. Math. math. Phys."},{"key":"10.1016\/0305-0548(86)90034-1_BIB25","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1287\/mnsc.18.9.540","article-title":"Extreme point mathematical programming","volume":"18","author":"Kirby","year":"1972","journal-title":"Mgmt Sci."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054886900341?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054886900341?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T16:53:53Z","timestamp":1552928033000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054886900341"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,1]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1986,1]]}},"alternative-id":["0305054886900341"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(86)90034-1","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1986,1]]}}}