{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T16:29:16Z","timestamp":1774456156516,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1976,12,1]],"date-time":"1976-12-01T00:00:00Z","timestamp":218246400000},"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":[[1976,12]]},"DOI":"10.1007\/bf01580367","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T05:55:54Z","timestamp":1114667754000},"page":"14-27","source":"Crossref","is-referenced-by-count":195,"title":["A cutting plane algorithm for solving bilinear programs"],"prefix":"10.1007","volume":"11","author":[{"given":"Hiroshi","family":"Konno","sequence":"first","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,Bullentin de l'Acad\u00e9mie Polonaise des Sciences 16 (9) (1968) 741\u2013746.","journal-title":"Bullentin de l'Acad\u00e9mie Polonaise des Sciences"},{"key":"CR2","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, GSIA, Carnegie-Mellon University, Pittsburgh, Pa. (July 1973)."},{"issue":"1","key":"CR3","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/opre.18.1.82","volume":"18","author":"A.V. Cabot","year":"1970","unstructured":"A.V. Cabot and R.L. Francis, \u201cSolving certain nonconvex quadratic minimization problems by ranking extreme points\u201d,Operations Research 18 (1) (1970) 82\u201386.","journal-title":"Operations Research"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"132","DOI":"10.2307\/1907747","volume":"25","author":"A. Charnes","year":"1957","unstructured":"A. Charnes and W.W. Cooper, \u201cNonlinear power of adjacent extreme point methods in linear programming\u201d,Econometrica 25 (1957) 132\u2013153.","journal-title":"Econometrica"},{"issue":"3","key":"CR5","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1287\/mnsc.10.3.515","volume":"10","author":"W. Candler","year":"1964","unstructured":"W. Candler and R.J. Townsley, \u201cThe Maximization of a quadratic function of variables subject to linear inequalities\u201d,Management Science 10 (3) (1964) 515\u2013523.","journal-title":"Management Science"},{"key":"CR6","volume-title":"Integer and nonlinear programming","author":"R.W. Cottle","year":"1970","unstructured":"R.W. Cottle and W.C. Mylander, \u201cRitter's cutting plane method for nonconvex quadratic programming\u201d, in: J. Abadie, ed.,Integer and nonlinear programming (North Holland, Amsterdam, 1970)."},{"key":"CR7","unstructured":"G.B. Dantzig, \u201cReduction of a 0\u20131 integer program to a bilinear separable program and to a standard complementary problem\u201d, Unpublished Note, July 27, 1971."},{"key":"CR8","unstructured":"G.B. Dantzig, \u201cSolving two-move games with perfect information\u201d, RAND Report P-1459, Santa Monica, Calif. (1958)."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF01580119","volume":"5","author":"J. Falk","year":"1973","unstructured":"J. Falk, \u201cA linear max-min problem\u201d, Mathematical Programming 5 (1973) 169\u2013188.","journal-title":"Mathematical Programming"},{"key":"CR10","unstructured":"G. Gallo and A. \u00dclk\u00fcc\u00fc, \u201cBilinear programming: an exact algorithm\u201d, Paper presented at the 8th International Symposium on Mathematical Programming, Stanford University, Stanford, California, August 1973."},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"K. Konno, \u201cMaximization of convex quadratic function under linear constraints\u201d,Mathematical Programming 11 (1976) to appear.","DOI":"10.1007\/BF01580380"},{"key":"CR12","volume-title":"\u201cBilinear programming part II: applications of bilinear programming\u201d, Tech. Rept. No. 71-10","author":"H. Konno","year":"1971","unstructured":"H. Konno, \u201cBilinear programming part II: applications of bilinear programming\u201d, Tech. Rept. No. 71-10, Department of Operations Research, Stanford University, Stanford, Calif. (August 1971)."},{"issue":"4","key":"CR13","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1137\/0112064","volume":"12","author":"O.L. Mangasarian","year":"1964","unstructured":"O.L. Mangasarian, \u201cEquilibrium points of bimatrix games\u201d,SIAM Journal of Applied Mathematics 12 (4) (1964) 778\u2013780.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0022-247X(64)90021-6","volume":"9","author":"O.L. Mangasarian","year":"1964","unstructured":"O.L. Mangasarian and H. Stone, \u201cTwo-person nonzero-sum games and quadratic programming\u201d,Journal of Mathematical Analysis and Applications 9 (1964) 348\u2013355.","journal-title":"Journal of Mathematical Analysis and Applications"},{"issue":"2","key":"CR15","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1137\/0108026","volume":"8","author":"H. Mills","year":"1960","unstructured":"H. Mills, \u201cEquilibrium points in finite games\u201d,SIAM Journal of Applied Mathematics 8 (2) (1960) 397\u2013402.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"CR16","volume-title":"\u201cNonconvex quadratic programming by a modification of Lemke's method\u201d, RAC-TP-414","author":"W.C. Mylander","year":"1971","unstructured":"W.C. Mylander, \u201cNonconvex quadratic programming by a modification of Lemke's method\u201d, RAC-TP-414, Research Analysis Corporation, McLean, Va. (1971)."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/BF00539118","volume":"4","author":"K. Ritter","year":"1966","unstructured":"K. Ritter, \u201cA method for solving maximum problems with a nonconcave quadratic objective function\u201d,Zeitung f\u00fcr Wahrscheinlichkeitstheorie und verwandte Gebiete 4 (1966) 340\u2013351.","journal-title":"Zeitung f\u00fcr Wahrscheinlichkeitstheorie und verwandte Gebiete"},{"issue":"4","key":"CR18","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1287\/opre.17.4.680","volume":"17","author":"M. Raghavachari","year":"1969","unstructured":"M. Raghavachari, \u201cOn connections between zero-one integer programming and concave programming under linear constraints\u201d,Operations Research 17 (4) (1969) 680\u2013684.","journal-title":"Operations Research"},{"key":"CR19","unstructured":"H. Tui, \u201cConcave programming under linear constraints\u201d,Soviet Mathematics (1964) 1537\u20131440."},{"issue":"6","key":"CR20","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: counterexamples to two global optimization algorithms\u201d,Operations Research 21 (6) (1973) 1260\u20131266.","journal-title":"Operations Research"},{"key":"CR21","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 (1971) pp. 457\u2013465.","DOI":"10.1145\/800184.810515"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580367.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580367\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580367","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:12:07Z","timestamp":1556881927000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580367"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,12]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1976,12]]}},"alternative-id":["BF01580367"],"URL":"https:\/\/doi.org\/10.1007\/bf01580367","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1976,12]]}}}