{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T20:06:45Z","timestamp":1773778005006,"version":"3.50.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[1992,12]]},"DOI":"10.1007\/bf00249639","type":"journal-article","created":{"date-parts":[[2004,9,17]],"date-time":"2004-09-17T23:14:56Z","timestamp":1095462896000},"page":"299-306","source":"Crossref","is-referenced-by-count":11,"title":["Generation of disjointly constrained bilinear programming test problems"],"prefix":"10.1007","volume":"1","author":[{"given":"Luis N.","family":"Vicente","sequence":"first","affiliation":[]},{"given":"Paul H.","family":"Calamai","sequence":"additional","affiliation":[]},{"given":"Joaquim J.","family":"J\u00fadice","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF00249639_CR1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01593787","volume":"12","author":"G. Gallo","year":"1977","unstructured":"G. Gallo and A. \u00dclk\u00fcc\u00fc, \u201cBilinear programming: an exact algorithm,\u201d Math. Programming, vol. 12, pp. 173\u2013194, 1977.","journal-title":"Math. Programming"},{"key":"BF00249639_CR2","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1016\/0305-0548(91)90002-9","volume":"18","author":"J. Judice","year":"1991","unstructured":"J. Judice and A. Faustino, \u201cA computational analysis of LCP methods for bilinear and concave quadratic programming,\u201d Comput. Oper. Res., vol. 18, pp. 645\u2013654, 1991.","journal-title":"Comput. Oper. Res."},{"key":"BF00249639_CR3","unstructured":"H. Konno, \u201cBilinear programming \u2014 Part II \u2014 Applications,\u201d Dept. of Oper. Res. Tech. Report No. 71-10, Stanford Univ., 1971."},{"key":"BF00249639_CR4","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 Math. Programming, vol. 11, pp. 14\u201327, 1976.","journal-title":"Math. Programming"},{"key":"BF00249639_CR5","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 Math. Programming, vol. 11, pp. 117\u2013127, 1976.","journal-title":"Math. Programming"},{"key":"BF00249639_CR6","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1137\/0203021","volume":"3","author":"S. Sahni","year":"1974","unstructured":"S. Sahni, \u201cComputational related topics,\u201d SIAM J. Comput., vol. 3, pp. 262\u2013279, 1974.","journal-title":"SIAM J. Comput."},{"key":"BF00249639_CR7","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF01581626","volume":"19","author":"H. Sherali","year":"1980","unstructured":"H. Sherali and C. Shetty, \u201cA finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts\u201d Math. Programming, vol. 19, pp. 14\u201331, 1980.","journal-title":"Math. Programming"},{"key":"BF00249639_CR8","unstructured":"H. Vaish, \u201cNonconvex programming, with applications to production and location problem,\u201d PhD thesis, Georgia Inst. of Tech., 1974 (unpublished)."},{"key":"BF00249639_CR9","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1002\/nav.3800230212","volume":"23","author":"H. Vaish","year":"1976","unstructured":"H. Vaish and C. Shetty, \u201cThe bilinear programming problem,\u201d Nav. Res. Logistics Q., vol. 23, pp. 303\u2013309, 1976.","journal-title":"Nav. Res. Logistics Q."},{"key":"BF00249639_CR10","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800240107","volume":"24","author":"H. Vaish","year":"1977","unstructured":"H. Vaish and C. Shetty, \u201cA cutting plane algorithm for bilinear programming problem,\u201d Nav. Res. Logistics Q., vol. 24, 83\u201394, 1977.","journal-title":"Nav. Res. Logistics Q."},{"key":"BF00249639_CR11","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF00119989","volume":"1","author":"Y. Yajima","year":"1991","unstructured":"Y. Yajima and H. Konno, \u201cEfficient algorithms for solving rank two and rank three bilinear programming problems,\u201d J. of Global Optimization, vol. 1, pp. 155\u2013171, 1991.","journal-title":"J. of Global Optimization"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00249639.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00249639\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00249639","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T15:56:10Z","timestamp":1554306970000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00249639"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["BF00249639"],"URL":"https:\/\/doi.org\/10.1007\/bf00249639","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}