{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T19:48:29Z","timestamp":1652816909350},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/bf00119989","type":"journal-article","created":{"date-parts":[[2004,11,4]],"date-time":"2004-11-04T04:09:28Z","timestamp":1099541368000},"page":"155-171","source":"Crossref","is-referenced-by-count":13,"title":["Efficient algorithms for solving rank two and rank three bilinear programming problems"],"prefix":"10.1007","volume":"1","author":[{"given":"Yasutoshi","family":"Yajima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Konno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"Chv\u00e1tal, V. (1983), Linear Programming, W. H. Freeman and Company."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF01580119","volume":"5","author":"J. E. Falk","year":"1973","unstructured":"Falk, J. E. (1973), A Linear Max-Min Problem, Mathematical Programming 5, 169?188.","journal-title":"Mathematical Programming"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1287\/moor.1.3.251","volume":"1","author":"J. E. Falk","year":"1976","unstructured":"Falk, J. E. and Hoffman, K. R. (1976), A Successive Underestimation Method for Concave Minimization Problems, Math. Oper. Res. 1, 251?259.","journal-title":"Math. Oper. Res."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01593787","volume":"12","author":"G. Gallo","year":"1977","unstructured":"Gallo, G. and \u00dclk\u00fcc\u00fc, A. (1977), Bilinear Programming: An Exact Algorithm, Mathematical Programming 12, 173?194.","journal-title":"Mathematical Programming"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"Horst, R. and Tiuy, H. (1990), Global Optimization, Springer-Verlag.","DOI":"10.1007\/978-3-662-02598-7"},{"key":"CR6","unstructured":"Konno, H. (1971), Bilinear Programming, Part 1 and 2, Technical Report No. 71-9, 71-10, Dept. of OR, Stanford University."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF01580367","volume":"11","author":"H. Konno","year":"1976","unstructured":"Konno, H. (1976), A Cutting Plane Algorithm for Solving Bilinear Programs, Mathematical Programming 11, 14?27.","journal-title":"Mathematical Programming"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF01580380","volume":"11","author":"H. Konno","year":"1976","unstructured":"Konno, H. (1976), Maximization of a Convex Quadratic Function under Linear Constraints, Mathematical Programming 11, 117?127.","journal-title":"Mathematical Programming"},{"key":"CR9","unstructured":"Konno, H. and Yajima, Y. (1990), Solving Rank Two Bilinear Programs by Parametric Simplex Algorithms, IHSS Report 90-17, Institute of Human and Social Sciences, Tokyo Institute of Technology."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"Konno, H., Yajima, Y., and Matsui, T. (1990), Parametric Simplex Algorithm for Solving a Special Class of Nonconvex Minimization Problems, IHSS Report 90-16, Institute of Human and Social Sciences, Tokyo Institute of Technology. (See also J. of Global Optimization 1, 65?81).","DOI":"10.1007\/BF00120666"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1109\/TC.1984.1676388","volume":"33","author":"D. T. Lee","year":"1984","unstructured":"Lee, D. T. and Preparata, F. P. (1984), Computational Geometry ? a Survey, IEEE Transactions on Computers c-33, 1072?1101.","journal-title":"IEEE Transactions on Computers"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0012-365X(74)90070-3","volume":"9","author":"A. Majthay","year":"1974","unstructured":"Majthay, A. and Whinston, A. B. (1974), Quasi-Concave Minimization Subject to Linear Constraints, Discrete Math. 9, 35?59.","journal-title":"Discrete Math."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF01581626","volume":"19","author":"H. Sherali","year":"1980","unstructured":"Sherali, H. and Shetty, C. M. (1980), A Finitely Convergent Algorithm for Bilinear Programming Problems Using Polar Cuts and Disjunctive Face Cuts, Mathematical Programming 19, 14?31.","journal-title":"Mathematical Programming"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1287\/moor.5.4.556","volume":"5","author":"N. V. Thaoi","year":"1980","unstructured":"Thaoi, N. V. and Tuy, H. (1980), Convergent Algorithms for Minimizing Concave Function, Math. Oper. Res. 5, 556?566.","journal-title":"Math. Oper. Res."},{"key":"CR15","first-page":"1437","volume":"5","author":"H. Tuy","year":"1964","unstructured":"Tuy, H. (1964), Concave Programming under Linear Constraints, Soviet Mathematics 5, 1437?1440.","journal-title":"Soviet Mathematics"},{"key":"CR16","first-page":"489","volume":"10","author":"H. Tuy","year":"1985","unstructured":"Tuy, H., Thieu, T. V., and Thaoi, N. Q. (1985), A Conical Algorithm for Globally Minimizing a Concave Function over a Closed Convex Set, Math. Oper. Res. 10, 489?514.","journal-title":"Math. Oper. Res."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1002\/nav.3800230212","volume":"23","author":"H. Vaish","year":"1976","unstructured":"Vaish, H. and Shetty, C. M. (1976), The Bilinear Programming Problem, NRLQ 23, 303?309.","journal-title":"NRLQ"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800240107","volume":"24","author":"H. Vaish","year":"1977","unstructured":"Vaish, H. and Shetty, C. M. (1977), A Cutting Plane Algorithm for Bilinear Programming Problem, NRLQ 24, 83?94.","journal-title":"NRLQ"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00119989.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00119989\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00119989","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T19:40:42Z","timestamp":1585942842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00119989"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991]]}},"alternative-id":["BF00119989"],"URL":"https:\/\/doi.org\/10.1007\/bf00119989","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991]]}}}