{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:46:55Z","timestamp":1751366815109},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1984,9,1]],"date-time":"1984-09-01T00:00:00Z","timestamp":462844800000},"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":[[1984,9]]},"DOI":"10.1007\/bf02591797","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T11:39:42Z","timestamp":1175168382000},"page":"22-45","source":"Crossref","is-referenced-by-count":39,"title":["Nonlinear 0\u20131 programming: II. Dominance relations and algorithms"],"prefix":"10.1007","volume":"30","author":[{"given":"Egon","family":"Balas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph B.","family":"Mazzola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02591797_CR1","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E. Balas","year":"1975","unstructured":"E. Balas, \u201cFacets of the knapsack polytope\u201d,Mathematical Programming 8 (1975) 146\u2013164.","journal-title":"Mathematical Programming"},{"key":"BF02591797_CR2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1137\/0123007","volume":"23","author":"E. Balas","year":"1972","unstructured":"E. Balas and R. G. Jeroslow, \u201cCanonical cuts on the unit hypercube\u201d,SIAM Journal of Applied Mathematics 23 (1972) 61\u201369.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"BF02591797_CR3","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-A heuristic for 0\u20131 programming\u201d,Management Science 26 (1980) 86\u201396.","journal-title":"Management Science"},{"key":"BF02591797_CR4","unstructured":"E. Balas and J. B. Mazzola, \u201cLinearizing nonlinear 0\u20131 programs: Some new techniques\u201d. Paper presented at the ORSA\/TIMS Meeting in Milwaukee, October 17\u201319, 1979."},{"key":"BF02591797_CR5","series-title":"MSRR No. 467","volume-title":"Linearizing nonlinear 0\u20131 programs","author":"E. Balas","year":"1980","unstructured":"E. Balas and J. B. Mazzola, \u201cLinearizing nonlinear 0\u20131 programs\u201d, MSRR No. 467, Carnegie-Mellon University, Pittsburgh, PA, October 1980."},{"key":"BF02591797_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02591796","volume":"30","author":"E. Balas","year":"1984","unstructured":"E. Balas and J. B. Mazzola, \u201cNonlinear 0\u20131 programming: I. Linearization techniques\u201d,Mathematical Programming 30 (1984) 1\u201321 (this issue).","journal-title":"Mathematical Programming"},{"key":"BF02591797_CR7","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1287\/opre.11.4.637","volume":"11","author":"D. H. Evans","year":"1963","unstructured":"D. H. Evans, \u201cModular design\u2014a special case in nonlinear programming\u201d,Operations Research 11 (1963) 637\u2013647.","journal-title":"Operations Research"},{"key":"BF02591797_CR8","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1287\/opre.18.3.562","volume":"18","author":"D. H. Evans","year":"1970","unstructured":"D. H. Evans, \u201cA note on \u2018Modular design\u2014A special case in nonlinear programming\u201d,Operations Research 18 (1970) 562\u2013564.","journal-title":"Operations Research"},{"key":"BF02591797_CR9","doi-asserted-by":"crossref","first-page":"1442","DOI":"10.1287\/opre.28.6.1442","volume":"28","author":"D. Granot","year":"1980","unstructured":"D. Granot and F. Granot, \u201cGeneralized covering relaxation for 0\u20131 programs\u201d,Operations Research 28 (1980) 1442\u20131449.","journal-title":"Operations Research"},{"key":"BF02591797_CR10","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1287\/mnsc.25.3.264","volume":"25","author":"D. Granot","year":"1979","unstructured":"D. Granot, F. Granot and J. Kallberg, \u201cCovering relaxation for positive 0\u20131 polynomial programs\u201d,Management Science 25 (1979) 264\u2013273.","journal-title":"Management Science"},{"key":"BF02591797_CR11","unstructured":"D. Granot, F. Granot and W. Vaessen, \u201cAn accelerated covering relaxation algorithm for solving 0\u20131 positive polynomial programs\u201d, Working Paper No. 718, University of British Columbia, 1980."},{"key":"BF02591797_CR12","first-page":"154","volume":"12","author":"F. Granot","year":"1971","unstructured":"F. Granot and P. L. Hammer, \u201cOn the use of Boolean functions in 0\u20131 programming\u201d,Methods for Operations Research 12 (1971) 154\u2013184.","journal-title":"Methods for Operations Research"},{"key":"BF02591797_CR13","unstructured":"S.S. Hamlen, \u201cA chance-constrained mixed integer programming model for internal control design\u201d,The Accounting Review LV (1980) 578\u2013593."},{"key":"BF02591797_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-85823-9","volume-title":"Boolean methods in operations research and related areas","author":"P. L. Hammer","year":"1968","unstructured":"P. L. Hammer and S. Rudeanu,Boolean methods in operations research and related areas (Springer, Berlin, New York, 1968)."},{"key":"BF02591797_CR15","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1287\/mnsc.26.5.439","volume":"26","author":"P. Kolesar","year":"1980","unstructured":"P. Kolesar. \u201cTesting for vision loss in glaucoma suspects\u201d,Management Science 26 (1980) 439\u2013450.","journal-title":"Management Science"},{"key":"BF02591797_CR16","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1287\/mnsc.17.5.320","volume":"17","author":"D. E. Peterson","year":"1971","unstructured":"D. E. Peterson and D. Laughhunn, \u201cCapital expenditure programming and some alternative approaches to risk\u201d,Management Science 17 (1971) 320\u2013336.","journal-title":"Management Science"},{"key":"BF02591797_CR17","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1287\/mnsc.16.1.93","volume":"16","author":"A. Pritsker","year":"1969","unstructured":"A. Pritsker, L. J. Watters and F. Wolfe, \u201cMultiproject scheduling with limited resources: A zero-one programming approach\u201d,Management Science 16 (1969) 622\u2013626.","journal-title":"Management Science"},{"key":"BF02591797_CR18","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1080\/01621459.1971.10482319","volume":"66","author":"M. R. Rao","year":"1971","unstructured":"M. R. Rao, \u201cCluster analysis and mathematical programming\u201d.Journal of the American Statistical Association 66 (1971) 622\u2013626.","journal-title":"Journal of the American Statistical Association"},{"key":"BF02591797_CR19","unstructured":"K E. Stecke, \u201cNonlinear MIP formulations of production planning problems in flexible manufacturing systems\u201c, Working Paper No. 293, GSBA, University of Michigan, March 1982."},{"key":"BF02591797_CR20","unstructured":"K. E. Stecke and J.J. Solberg, \u201cThe optimality of unbalanced workloads and machine group sizess for flexible manufacturing systems\u201d. Working Paper No. 290, GSBA, University of Michigan, January 1982."},{"key":"BF02591797_CR21","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1287\/mnsc.18.6.B328","volume":"18B","author":"H. A. Taha","year":"1972","unstructured":"H. A. Taha, \u201cA Balasian-based algorithm for zero-one polynomial programming\u201d,Management Science 18B (1972) 328\u2013343.","journal-title":"Management Science"},{"key":"BF02591797_CR22","first-page":"30","volume":"5","author":"W. Zangwill","year":"1965","unstructured":"W. Zangwill, \u201cMedia selection by decision programming\u201d,Journal of Advertising Research 5 (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\/BF02591797.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02591797\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591797","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T19:37:50Z","timestamp":1558381070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02591797"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,9]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1984,9]]}},"alternative-id":["BF02591797"],"URL":"https:\/\/doi.org\/10.1007\/bf02591797","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,9]]}}}