{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T11:06:22Z","timestamp":1751367982106},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":[[1985,1]]},"DOI":"10.1007\/bf02591860","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T11:40:07Z","timestamp":1175168407000},"page":"42-56","source":"Crossref","is-referenced-by-count":20,"title":["On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs"],"prefix":"10.1007","volume":"31","author":[{"given":"S.","family":"Sen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanif D.","family":"Sherali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02591860_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E. Balas","year":"1979","unstructured":"E. Balas, \u201cDisjunctive programming\u201d,Annals of Discrete Mathematics 5 (1979) 3\u201351.","journal-title":"Annals of Discrete Mathematics"},{"key":"BF02591860_CR2","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0166-218X(80)90037-2","volume":"2","author":"C.E. Blair","year":"1980","unstructured":"C.E. Blair, \u201cFacial disjunctive programs and sequences of cutting planes\u201d,Discrete Applied Mathematics 2 (1980) 173\u2013179.","journal-title":"Discrete Applied Mathematics"},{"key":"BF02591860_CR3","series-title":"working paper","volume-title":"Extensions of a theorem of Balas","author":"C.E. Blair","year":"1980","unstructured":"C.E. Blair and R.G. Jeroslow, \u201cExtensions of a theorem of Balas\u201d, working paper, School of Industrial Management, Georgia Institute of Technology (Atlanta, GA, 1980)."},{"key":"BF02591860_CR4","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1287\/opre.23.3.565","volume":"23","author":"A.V. Cabot","year":"1975","unstructured":"A.V. Cabot, \u201cOn the generalized lattice point problem and nonlinear programming\u201d,Operations Research 23 (1975) 565\u2013571.","journal-title":"Operations Research"},{"key":"BF02591860_CR5","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/nav.3800210206","volume":"21","author":"A.V. Cabot","year":"1974","unstructured":"A.V. Cabot, \u201cVariations on a cutting plane method for solving concave minimization problems with linear constraints\u201d,Naval Research Logistics Quarterly 21 (1974) 265\u2013274.","journal-title":"Naval Research Logistics Quarterly"},{"key":"BF02591860_CR6","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1287\/opre.21.1.123","volume":"21","author":"F. Glover","year":"1973","unstructured":"F. Glover, \u201cConvexity cuts and cut search\u201d,Operations Research 21 (1973) 123\u2013124.","journal-title":"Operations Research"},{"key":"BF02591860_CR7","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1287\/opre.21.1.141","volume":"21","author":"F. Glover","year":"1973","unstructured":"F. Glover and D. Klingman, \u201cThe generalized lattice point problem\u201d,Operations Research 21 (1973) 141\u2013155.","journal-title":"Operations Research"},{"key":"BF02591860_CR8","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0167-5060(08)70741-6","volume":"1","author":"R.G. Jeroslow","year":"1977","unstructured":"R.G. Jeroslow, \u201cCutting plane theory: Disjunctive methods\u201d,Annals of Discrete Mathematics 1 (1977) 293\u2013330.","journal-title":"Annals of Discrete Mathematics"},{"key":"BF02591860_CR9","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/0318018","volume":"18","author":"R.G. Jeroslow","year":"1980","unstructured":"R.G. Jeroslow, \u201cA cutting plane game for facial disjunctive programs\u201d,SIAM Journal on Control and Optimization 18 (1980) 264\u2013281.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"BF02591860_CR10","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0167-5060(08)70345-5","volume":"5","author":"E.L. Johnson","year":"1979","unstructured":"E.L. Johnson, \u201cOn the group problem and a subadditive approach to integer programming\u201d,Annals of Discrete Mathematics 5 (1979) 97\u2013112.","journal-title":"Annals of Discrete Mathematics"},{"key":"BF02591860_CR11","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.R. Love and K. Swarup, \u201cExtreme point mathematical programming,\u201dManagement Science 18 (1972) 540\u2013549.","journal-title":"Management Science"},{"key":"BF02591860_CR12","doi-asserted-by":"crossref","unstructured":"A. Majthay and A. Whinston, \u201cQuasi-concave minimization subject to linear constraints\u201d,Discrete Mathematics 9 1(74) 35\u201359.","DOI":"10.1016\/0012-365X(74)90070-3"},{"key":"BF02591860_CR13","unstructured":"H.M. Salkin,Integer programming (Addison Wesley Publishing Company, 1975)."},{"key":"BF02591860_CR14","series-title":"working paper","volume-title":"Cutting plane and enumeration algorithms for extreme point mathematical programs and related problem","author":"S. Sen","year":"1982","unstructured":"S. Sen and H.D. Sherali, \u201cCutting plane and enumeration algorithms for extreme point mathematical programs and related problem\u201d, working paper, Department of Industrial Engineering and Operations Research, Virginia Polytechnic Institute and State University (Blacksburg, VA, 1982)."},{"key":"BF02591860_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-48794-1","volume-title":"Optimization with disjunctive constraints","author":"H.D. Sherali","year":"1980","unstructured":"H.D. Sherali and C.M. Shetty.Optimization with disjunctive constraints (Springer-Verlag, Heidelberg-New York, 1980)."},{"key":"BF02591860_CR16","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1002\/nav.3800270310","volume":"27","author":"H.D. Sherali","year":"1980","unstructured":"H.D. Sherali and C.M. Shetty, \u201cDeep cuts in disjunctive programming\u201d,Naval Research Logistics Quarterly 27 (1980) 453\u2013475.","journal-title":"Naval Research Logistics Quarterly"},{"key":"BF02591860_CR17","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF01581626","volume":"19","author":"H.D. Sherali","year":"1980","unstructured":"H.D. Sherali and C.M. Shetty, \u201cA finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts\u201d,Mathematical Programming 19 (1980) 14\u201331.","journal-title":"Mathematical Programming"},{"key":"BF02591860_CR18","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0166-218X(82)90071-3","volume":"4","author":"H.D. Sherali","year":"1982","unstructured":"H.D. Sherali and C.M. Shetty, \u201cA finitely convergent procedure for facial disjunctive programs\u201d,Discrete Applied Mathematics 4 (1982) 135\u2013148.","journal-title":"Discrete Applied Mathematics"},{"key":"BF02591860_CR19","volume-title":"Cardinality constrained linear programming","author":"T. Tanahashi","year":"1971","unstructured":"T. Tanahashi, \u201cCardinality constrained linear programming\u201d, Unpublished Doctoral Dissertation, Department of Engineering-Economic Systems, Stanford University (Stanford, CA, 1971)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591860.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02591860\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591860","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T19:37:50Z","timestamp":1558381070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02591860"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,1]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,1]]}},"alternative-id":["BF02591860"],"URL":"https:\/\/doi.org\/10.1007\/bf02591860","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,1]]}}}