{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T20:35:31Z","timestamp":1774557331814,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"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":[[1993,3]]},"DOI":"10.1007\/bf01581249","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:46:38Z","timestamp":1114681598000},"page":"279-305","source":"Crossref","is-referenced-by-count":74,"title":["Mixed-integer bilinear programming problems"],"prefix":"10.1007","volume":"59","author":[{"given":"Warren P.","family":"Adams","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanif D.","family":"Sherali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"CR1","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1287\/opre.38.2.217","volume":"38","author":"W.P. Adams","year":"1990","unstructured":"W.P. Adams and H.D. Sherali, \u201cLinearization strategies for a class of zero\u2014one mixed integer programming problems,\u201dOperations Research 38(2) (1990) 217\u2013226.","journal-title":"Operations Research"},{"key":"CR2","volume-title":"The mixed-integer bilinear programming problem with extensions to zero\u2014one quadratic programs","author":"W. Adams","year":"1984","unstructured":"W. Adams, \u201cThe mixed-integer bilinear programming problem with extensions to zero\u2014one quadratic programs,\u201d Ph.D. Dissertation, Department of Industrial Engineering and Operations Research, Virginia Polytechnic Institute and State University (Blacksburg, VA, 1984)."},{"issue":"1","key":"CR3","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1287\/mnsc.16.1.14","volume":"16","author":"E. Balas","year":"1969","unstructured":"E. Balas, \u201cDuality in discrete programming: II. The quadratic case,\u201dManagement Science 16(1) (1969) 14\u201332.","journal-title":"Management Science"},{"issue":"4","key":"CR4","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1287\/opre.13.4.517","volume":"13","author":"E. Balas","year":"1965","unstructured":"E. Balas, \u201cAn additive algorithm for solving linear programs with zero\u2014one variables,\u201dOperations Research 13(4) (1965) 517\u2013546.","journal-title":"Operations Research"},{"issue":"1","key":"CR5","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/mnsc.26.1.86","volume":"26","author":"E. Balas","year":"1980","unstructured":"E. Balas and C.H. Martin, \u201cPivot and complement \u2014 A heuristic for 0\u20131 programming,\u201dManagement Science 26(1) (1980) 86\u201396.","journal-title":"Management Science"},{"issue":"4","key":"CR6","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1016\/0377-2217(81)90096-5","volume":"7","author":"M.S. Bazaraa","year":"1981","unstructured":"M.S. Bazaraa and H.D. Sherali, \u201cOn the choice of step size in subgradient optimization,\u201dEuropean Journal of Operational Research 7(4) (1981) 380\u2013388.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"CR7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/nav.3800270104","volume":"27","author":"M.S. Bazaraa","year":"1980","unstructured":"M.S. Bazaraa and H.D. Sherali, \u201cBenders' partitioning scheme applied to a new formulation of the quadratic assignment problem,\u201dNaval Research Logistics Quarterly 27(1) (1980) 29\u201341.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"4","key":"CR8","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1002\/nav.3800280404","volume":"28","author":"M.S. Bazaraa","year":"1981","unstructured":"M.S. Bazaraa and H.D. Sherali, \u201cA versatile scheme for ranking the extreme points of an assignment polytope,\u201dNaval Research Logistics Quarterly 28(4) (1981) 545\u2013557.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"3","key":"CR9","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J.F. Benders","year":"1962","unstructured":"J.F. Benders, \u201cPartitioning procedures for solving mixed-variables programming problems,\u201dNumerische Mathematik 4(3) (1962) 238\u2013252.","journal-title":"Numerische Mathematik"},{"issue":"1","key":"CR10","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 the extreme points,\u201dOperations Research 18(1) (1970) 82\u201386.","journal-title":"Operations Research"},{"issue":"2","key":"CR11","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1090\/qam\/112751","volume":"18","author":"W.S. Dorn","year":"1960","unstructured":"W.S. Dorn, \u201cDuality in quadratic programming,\u201dQuarterly of Applied Mathematics 18(2) (1960) 155\u2013162.","journal-title":"Quarterly of Applied Mathematics"},{"issue":"3","key":"CR12","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1287\/opre.17.3.437","volume":"17","author":"A.M. Geoffrion","year":"1969","unstructured":"A.M. Geoffrion, \u201cAn improved implicit enumeration approach for integer programming,\u201dOperations Research 17(3) (1969) 437\u2013454.","journal-title":"Operations Research"},{"issue":"5","key":"CR13","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1287\/mnsc.20.5.822","volume":"20","author":"A.M. Geoffrion","year":"1974","unstructured":"A.M. Geoffrion and G.W. Graves, \u201cMulticommodity distribution system design by Benders' decomposition,\u201dManagement Science 20(5) (1974) 822\u2013844.","journal-title":"Management Science"},{"issue":"4","key":"CR14","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"A.M. Geoffrion","year":"1972","unstructured":"A.M. Geoffrion, \u201cGeneralized Benders' decomposition,\u201dJournal of Optimization Theory and Applications 10(4) (1972) 237\u2013260.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1080\/05695557808975181","volume":"10","author":"A.M. Geoffrion","year":"1979","unstructured":"A.M. Geoffrion and R. McBryde, \u201cLagrangian relaxation applied to facility location problems,\u201dAIIE Transactions 10 (1979) 40\u201347.","journal-title":"AIIE Transactions"},{"issue":"4","key":"CR16","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/mnsc.22.4.455","volume":"22","author":"F. Glover","year":"1975","unstructured":"F. Glover, \u201cImproved linear integer programming formulations of nonlinear integer problems,\u201dManagement Science 22(4) (1975) 455\u2013460.","journal-title":"Management Science"},{"issue":"1","key":"CR17","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1287\/opre.21.1.156","volume":"21","author":"F. Glover","year":"1973","unstructured":"F. Glover and E. Woolsey, \u201cFurther reduction of zero\u2014one polynomial programming problems to zero\u2014one linear programming problems,\u201dOperations Research 21(1) (1973) 156\u2013161.","journal-title":"Operations Research"},{"issue":"1","key":"CR18","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/opre.22.1.180","volume":"22","author":"F. Glover","year":"1974","unstructured":"F. Glover and E. Woolsey, \u201cConverting the 0\u20131 polynomial programming problem to a 0\u20131 linear program,\u201dOperations Research 22(1) (1974) 180\u2013182.","journal-title":"Operations Research"},{"issue":"1","key":"CR19","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","volume":"6","author":"M. Held","year":"1974","unstructured":"M. Held, P. Wolfe and H.P. Crowder, \u201cValidation of subgradient optimization,\u201dMathematical Programming 6(1) (1974) 62\u201388.","journal-title":"Mathematical Programming"},{"issue":"1","key":"CR20","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,\u201dMathematical Programming 11(1) (1976) 14\u201327.","journal-title":"Mathematical Programming"},{"issue":"3","key":"CR21","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/BF01581047","volume":"22","author":"R. Lazimy","year":"1982","unstructured":"R. Lazimy, \u201cMixed-integer quadratic programming,\u201dMathematical Programming 22(3) (1982) 332\u2013349.","journal-title":"Mathematical Programming"},{"issue":"3","key":"CR22","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1287\/opre.29.3.464","volume":"29","author":"T.L. Magnanti","year":"1981","unstructured":"T.L. Magnanti and R.T. Wong, \u201cAccelerating Benders' decomposition: algorithmic enhancement and model selection criteria,\u201dOperations Research 29(3) (1981) 464\u2013484.","journal-title":"Operations Research"},{"issue":"3","key":"CR23","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1287\/mnsc.24.3.312","volume":"24","author":"D. McDaniel","year":"1977","unstructured":"D. McDaniel and M. Devine, \u201cA modified Benders' partitioning algorithm for mixed integer programming,\u201dManagement Science 24(3) (1977) 312\u2013319.","journal-title":"Management Science"},{"key":"CR24","series-title":"Working Paper","volume-title":"A note on transforming the product of variables to linear form in linear programs","author":"C. Peterson","year":"1971","unstructured":"C. Peterson, \u201cA note on transforming the product of variables to linear form in linear programs,\u201d Working Paper, Purdue University (West Lafayette, IN, 1971)."},{"issue":"3","key":"CR25","first-page":"593","volume":"8","author":"B.T. Poljak","year":"1967","unstructured":"B.T. Poljak, \u201cA general method of solving extremum problems,\u201dSoviet Mathematics 8(3) (1967) 593\u2013597.","journal-title":"Soviet Mathematics"},{"issue":"6","key":"CR26","doi-asserted-by":"crossref","first-page":"1169","DOI":"10.1287\/opre.24.6.1169","volume":"24","author":"R.L. Rardin","year":"1976","unstructured":"R.L. Rardin and V.E. Unger, \u201cSurrogate constraints and the strength of bounds derived from 0\u20131 Benders' partitioning procedures,\u201dOperations Research 24(6) (1976) 1169\u20131175.","journal-title":"Operations Research"},{"key":"CR27","volume-title":"Integer Programming","author":"H.M. Salkin","year":"1975","unstructured":"H.M. Salkin,Integer Programming (Addison-Wesley, Reading, MA, 1975)."},{"issue":"3","key":"CR28","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, \u201cOn the generation of deep disjunctive cutting planes,\u201dNaval Research Logistics Quarterly 27(3) (1980) 453\u2013475.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"4","key":"CR29","doi-asserted-by":"crossref","first-page":"878","DOI":"10.1287\/opre.32.4.878","volume":"32","author":"H.D. Sherali","year":"1984","unstructured":"H.D. Sherali and W.P. Adams, \u201cA decomposition strategy for a discrete location allocation problem,\u201dOperations Research 32(4) (1984) 878\u2013900.","journal-title":"Operations Research"},{"key":"CR30","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 Ph.D. Dissertation, Georgia Institute of Technology (Atlanta, GA, 1974)."},{"issue":"6","key":"CR31","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1287\/opre.15.6.1171","volume":"15","author":"L. Watters","year":"1967","unstructured":"L. Watters, \u201cReduction of integer polynomial programming problems to zero\u2013one linear programming problems,\u201dOperations Research 15(6) (1967) 1171\u20131174.","journal-title":"Operations Research"},{"issue":"4","key":"CR32","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1287\/opre.24.4.643","volume":"24","author":"R.E. Wendell","year":"1976","unstructured":"R.E. Wendell and A.P. Hurter, Jr., \u201cMinimization of a non-separable objective function subject to disjoint constraints,\u201dOperations Research 24(4) (1976) 643\u2013657.","journal-title":"Operations Research"},{"key":"CR33","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/BFb0120693","volume":"2","author":"H.P. Williams","year":"1974","unstructured":"H.P. Williams, \u201cExperiments in the Formulation of Integer Programming Problems,\u201d in: M.L. Balinski, ed.,Mathematical Programming Study 2 (1974) 180\u2013197.","journal-title":"Mathematical Programming Study"},{"issue":"3","key":"CR34","first-page":"30","volume":"5","author":"W.I. Zangwill","year":"1965","unstructured":"W.I. Zangwill, \u201cMedia selection by decision programming,\u201dJournal of Advertising Research 5(3) (1965) 30\u201336.","journal-title":"Journal of Advertising Research"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581249.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581249\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581249","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:12:16Z","timestamp":1556896336000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581249"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":34,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["BF01581249"],"URL":"https:\/\/doi.org\/10.1007\/bf01581249","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}