{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T20:35:30Z","timestamp":1774557330939,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1980,12,1]],"date-time":"1980-12-01T00:00:00Z","timestamp":344476800000},"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":[[1980,12]]},"DOI":"10.1007\/bf01581626","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T04:29:02Z","timestamp":1114662542000},"page":"14-31","source":"Crossref","is-referenced-by-count":65,"title":["A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts"],"prefix":"10.1007","volume":"19","author":[{"given":"Hanif D.","family":"Sherali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. M.","family":"Shetty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"9","key":"CR1","first-page":"741","volume":"16","author":"M. Altman","year":"1968","unstructured":"M. Altman, \u201cBilinear programming\u201d,Bulletin d'Academie Polonaise des Sciences 16(9) (1968) 741\u2013746.","journal-title":"Bulletin d'Academie Polonaise des Sciences"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"E. Balas","year":"1971","unstructured":"E. Balas, \u201cIntersection cuts\u2014A new type of cutting planes for integer programming\u201d,Operations Research 19 (1971) 19\u201339.","journal-title":"Operations Research"},{"key":"CR3","volume-title":"\u201cIntersection cuts from disjunctive constraints\u201d, Management Science Research Report No. 330","author":"E. Balas","year":"1974","unstructured":"E. Balas, \u201cIntersection cuts from disjunctive constraints\u201d, Management Science Research Report No. 330, Carnegie-Mellon University (Pittsburg, PA, February 1974)."},{"key":"CR4","volume-title":"\u201cMaximizing a convex quadratic function subject to linear constraints\u201d, Management Science Research Report No. 299","author":"E. Balas","year":"1973","unstructured":"E. Balas and C.A. Burdet, \u201cMaximizing a convex quadratic function subject to linear constraints\u201d, Management Science Research Report No. 299, Carnegie-Mellon University (Pittsburg, PA, July 1973)."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1002\/nav.3800200103","volume":"20","author":"C.A. Burdet","year":"1973","unstructured":"C.A. Burdet, \u201cPolaroids: A new tool in nonconvex and in integer programming\u201d,Naval Research Logistics Quarterly 20 (1973) 13\u201322.","journal-title":"Naval Research Logistics Quarterly"},{"key":"CR6","volume-title":"Mathematical programming in theory and practice","author":"C.A. Burdet","year":"1974","unstructured":"C.A. Burdet, \u201cOn polaroid intersections\u201d, in: P. Hammer and G. Zoutendijk, eds.,Mathematical programming in theory and practice (North-Holland, Amsterdam, 1974)."},{"key":"CR7","first-page":"181","volume":"18","author":"F. Glover","year":"1974","unstructured":"F. Glover, \u201cPolyhedral convexity cuts and negative edge extensions\u201d,Zeitschrift f\u00fcr Operations Research 18 (1974) 181\u2013186.","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01681342","volume":"8","author":"F. Glover","year":"1975","unstructured":"F. Glover, \u201cPolyhedral annexation in mixed integer and combinatorial programming\u201d,Mathematical Programming 8 (1975) 161\u2013188.","journal-title":"Mathematical Programming"},{"key":"CR9","volume-title":"Convex polytopes","author":"B. Gr\u00fcnbaum","year":"1967","unstructured":"B. Gr\u00fcnbaum,Convex polytopes (Interscience, New York, 1967)."},{"key":"CR10","volume-title":"\u201cThe principles of cutting plane theory: Part I\u201d (with an addendum)","author":"R.G. Jeroslow","year":"1974","unstructured":"R.G. Jeroslow, \u201cThe principles of cutting plane theory: Part I\u201d (with an addendum), GSIA, Carnegie-Mellon University (Pittsburg, PA, February 1974)."},{"key":"CR11","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":"CR12","volume-title":"\u201cBilinear programming, Parts I and II\u201d, Technical Report No. 71-9 and 71-10","author":"H. Konno","year":"1971","unstructured":"H. Konno, \u201cBilinear programming, Parts I and II\u201d, Technical Report No. 71-9 and 71-10, Dept. of Operations Research, Stanford University (Stanford, CA, 1971)."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF01580367","volume":"11","author":"H. Konno","year":"1976","unstructured":"H. Konno, \u201cA cutting plane algorithm for solving bilinear programs\u201d,Mathematical Programming 11 (1976) 14\u201327.","journal-title":"Mathematical Programming"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF01580380","volume":"11","author":"H. Konno","year":"1976","unstructured":"H. Konno, \u201cMaximization of a convex quadratic function under linear constraints\u201d,Mathematical Programming 11 (1976) 117\u2013127.","journal-title":"Mathematical Programming"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0012-365X(74)90070-3","volume":"9","author":"A. Majthey","year":"1974","unstructured":"A. Majthey and A. Whinston, \u201cQuasi-concave minimization subject to linear constraints\u201d,Discrete Mathematics 9 (1974) 35\u201359.","journal-title":"Discrete Mathematics"},{"key":"CR16","first-page":"29","volume":"11","author":"G. Owen","year":"1973","unstructured":"G. Owen, \u201cCutting planes for programs with disjunctive constraints\u201d,Optimization Theory and its Applications 11 (1973) 29\u201355.","journal-title":"Optimization Theory and its Applications"},{"key":"CR17","unstructured":"H.D. Sherali and C.M. Shetty, \u201cDeep cuts in disjunctive programming\u201d, Paper presented at the Joint National ORSA\/TIMS Meeting, New Orleans, LA (May 1979)."},{"key":"CR18","unstructured":"C.M. Shetty and S. Selim, \u201cStochastic location\u2014allocation problems and bi-convex programming\u201d, Presented at the ORSA\/TIMS Meeting, New York, (May 1978)."},{"key":"CR19","doi-asserted-by":"crossref","unstructured":"C.M. Shetty and H.D. Sherali, \u201cRectilinear distance location\u2014allocation problem: A simplex based algorithm\u201d,Proc. of the Internat. Symp. on Extremal Methods and Systems Analysis, Lecture Notes in Economics and Math. Systems (Springer, 1980).","DOI":"10.1007\/978-3-642-46414-0_23"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1287\/opre.22.2.373","volume":"22","author":"R.M. Soland","year":"1974","unstructured":"R.M. Soland, \u201cOptimal facility location with concave costs\u201d,Operations Research 22 (1974) 373\u2013382.","journal-title":"Operations Research"},{"key":"CR21","volume-title":"Nonconvex programming with applications to production and location problems","author":"H. Vaish","year":"1974","unstructured":"H. Vaish, \u201cNonconvex programming with applications to production and location problems\u201d, Unpublished Ph.D. Dissertation, Georgia Institute of Technology (Atlanta, GA, 1974)."},{"key":"CR22","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800240107","volume":"24","author":"H. Vaish","year":"1977","unstructured":"H. Vaish and C.M. Shetty, \u201cA cutting plane algorithm for the bilinear programming problem\u201d,Naval Research Logistics Quarterly 24 (1977) 83\u201394.","journal-title":"Naval Research Logistics Quarterly"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1002\/nav.3800230212","volume":"23","author":"H. Vaish","year":"1976","unstructured":"H. Vaish and C.M. Shetty, \u201cThe bilinear programming problem\u201d,Naval Research Logistics Quarterly 23 (1976) 303\u2013309.","journal-title":"Naval Research Logistics Quarterly"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"1260","DOI":"10.1287\/opre.21.6.1260","volume":"21","author":"P. Zwart","year":"1973","unstructured":"P. Zwart, \u201cNonlinear programming: counter examples to two global optimization algorithms\u201d,Operations Research 21 (1973) 1260\u20131266.","journal-title":"Operations Research"},{"key":"CR25","doi-asserted-by":"crossref","unstructured":"P. Zwart, \u201cComputational aspects of the use of cutting planes in global optimization\u201d, in:Proceedings of the 1971 Annual Conference of the ACM (ACM, 1971) pp. 457\u2013465.","DOI":"10.1145\/800184.810515"},{"issue":"3","key":"CR26","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1287\/opre.22.3.602","volume":"22","author":"P. Zwart","year":"1976","unstructured":"P. Zwart, \u201cGlobal maximization of a convex function with linear inequality constraints\u201d,Operations Research 22(3) (1976) 602\u2013609.","journal-title":"Operations Research"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581626.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581626\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581626","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:12:19Z","timestamp":1556881939000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581626"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,12]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1980,12]]}},"alternative-id":["BF01581626"],"URL":"https:\/\/doi.org\/10.1007\/bf01581626","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980,12]]}}}