{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T05:22:47Z","timestamp":1648963367285},"reference-count":31,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1985,7,1]],"date-time":"1985-07-01T00:00:00Z","timestamp":489024000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10243,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1985,7]]},"DOI":"10.1016\/0166-218x(85)90078-2","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T11:17:01Z","timestamp":1034075821000},"page":"265-280","source":"Crossref","is-referenced-by-count":9,"title":["A branch and bound algorithm for extreme point mathematical programming problems"],"prefix":"10.1016","volume":"11","author":[{"given":"Suvrajeet","family":"Sen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanif D.","family":"Sherali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(85)90078-2_BIB1","series-title":"Nonlinear Programming","article-title":"Disjunctive programming: cutting planes from logical conditions","author":"Balas","year":"1975"},{"key":"10.1016\/0166-218X(85)90078-2_BIB2","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1137\/0126045","article-title":"Generating all the faces of a polyhedron","volume":"26","author":"Burdet","year":"1974","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0166-218X(85)90078-2_BIB3","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":"Naval Res. Logist. Quart."},{"key":"10.1016\/0166-218X(85)90078-2_BIB4","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":"Operations Research"},{"issue":"1","key":"10.1016\/0166-218X(85)90078-2_BIB5","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1080\/02522667.1980.10698659","article-title":"Critical path problems under assignment constraints: An application of an extreme point mathematical problem","volume":"1","author":"Chandasekaran","year":"1980","journal-title":"J. Inform. and Optimization Sci. (India)"},{"key":"10.1016\/0166-218X(85)90078-2_BIB6","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1287\/mnsc.12.7.576","article-title":"An algorithm for the solution of mixed integer programming problems","volume":"12","author":"Driebeek","year":"1966","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(85)90078-2_BIB7","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/mnsc.20.5.736","article-title":"Practical solution of large mixed integer programming problems with UMPIRE","volume":"20","author":"Forrest","year":"1974","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(85)90078-2_BIB8","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1137\/1009031","article-title":"Integer programming by implicit enumeration and Balas' method","volume":"7","author":"Ceoffrion","year":"1967","journal-title":"SIAM Review"},{"key":"10.1016\/0166-218X(85)90078-2_BIB9","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":"Operations Research"},{"key":"10.1016\/0166-218X(85)90078-2_BIB10","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":"Operations Research"},{"key":"10.1016\/0166-218X(85)90078-2_BIB11","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1137\/0602047","article-title":"Expected number of vertices of a random convex polyhedron","volume":"2","author":"Kelly","year":"1981","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(85)90078-2_BIB12","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":"Management Sci."},{"key":"10.1016\/0166-218X(85)90078-2_BIB13","first-page":"27","article-title":"Cutting plane algorithm for extreme point mathematical programming","volume":"14","author":"Kirby","year":"1972","journal-title":"Cashiers Centre Etudes Rech. Op\u00e9r."},{"key":"10.1016\/0166-218X(85)90078-2_BIB14","first-page":"14","article-title":"Production scheduling on N identical machines","volume":"8","author":"Kirby","year":"1970","journal-title":"J. Canad. Oper. Res. Soc."},{"key":"10.1016\/0166-218X(85)90078-2_BIB15","first-page":"127","article-title":"Some algorithms for solving extreme point mathematical programming problems","volume":"7","author":"Kumar","year":"1979","journal-title":"New Zealand J. Oper. Res."},{"key":"10.1016\/0166-218X(85)90078-2_BIB16","doi-asserted-by":"crossref","first-page":"497","DOI":"10.2307\/1910129","article-title":"An automatic method of solving discrete programming problems","volume":"28","author":"Land","year":"1960","journal-title":"Econometrica"},{"key":"10.1016\/0166-218X(85)90078-2_BIB17","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0167-5060(08)70352-2","article-title":"Computer codes for problems of integer programming","volume":"5","author":"Land","year":"1979","journal-title":"Annals Discrete Math."},{"key":"10.1016\/0166-218X(85)90078-2_BIB18","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":"Matheiss","year":"1973","journal-title":"Operations Research"},{"key":"10.1016\/0166-218X(85)90078-2_BIB19","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":"Matheiss","year":"1980","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0166-218X(85)90078-2_BIB20","first-page":"80","article-title":"Random polytopes: their definition, generation and aggregate properties","author":"May","year":"1980"},{"key":"10.1016\/0166-218X(85)90078-2_BIB21","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":"Europ. J. Oper. Res."},{"key":"10.1016\/0166-218X(85)90078-2_BIB22","first-page":"97","article-title":"Strong-Cut enumerative procedure for extreme points mathematical programming problems","volume":"17","author":"Puri","year":"1973","journal-title":"Z. Oper. Res."},{"key":"10.1016\/0166-218X(85)90078-2_BIB23","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/S0167-5060(08)70752-0","article-title":"Vertex generation methods for problems with logical constraints","volume":"1","author":"Rubin","year":"1977","journal-title":"Annals Discrete Math."},{"key":"10.1016\/0166-218X(85)90078-2_BIB24","doi-asserted-by":"crossref","unstructured":"S. Sen and H.D. Sherali, On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs, Math. Programming, to appear.","DOI":"10.1007\/BF02591860"},{"key":"10.1016\/0166-218X(85)90078-2_BIB25","unstructured":"H.D. Sherali and S. Sen, Cutting planes from combinatorial disjunctions with applications to extreme point and related mathematical programs, Working Paper, Department of Industrial Engineering and Operations Research, Virginia Polytechnic Institute and State University. (to appear in Operations Research)."},{"key":"10.1016\/0166-218X(85)90078-2_BIB26","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-48794-1","article-title":"Optimization with Disjunctive Constraints","author":"Sherali","year":"1980"},{"key":"10.1016\/0166-218X(85)90078-2_BIB27","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1287\/moor.5.4.556","article-title":"Convergent algorithms for minimizing a concave function","volume":"5","author":"Thoai","year":"1980","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0166-218X(85)90078-2_BIB28","series-title":"Integer and Nonlinear Programming","article-title":"Branch and bound methods for integer and nonconvex programming","author":"Tomlin","year":"1970"},{"key":"10.1016\/0166-218X(85)90078-2_BIB29","first-page":"1437","article-title":"Concave programming under linear constraints","volume":"5","author":"Tui","year":"1964","journal-title":"Soviet Math."},{"key":"10.1016\/0166-218X(85)90078-2_BIB30","doi-asserted-by":"crossref","first-page":"1393","DOI":"10.1287\/opre.19.6.1393","article-title":"Hypercylindrically deduced cuts in zero-one integer programs","volume":"19","author":"Young","year":"1971","journal-title":"Operations Research"},{"key":"10.1016\/0166-218X(85)90078-2_BIB31","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":"Operations Research"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X85900782?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X85900782?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T00:27:22Z","timestamp":1554769642000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X85900782"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,7]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,7]]}},"alternative-id":["0166218X85900782"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(85)90078-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1985,7]]}}}