{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:27:27Z","timestamp":1759667247560},"reference-count":26,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1988,5,1]],"date-time":"1988-05-01T00:00:00Z","timestamp":578448000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9208,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1988,5]]},"DOI":"10.1016\/0166-218x(88)90041-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"51-68","source":"Crossref","is-referenced-by-count":19,"title":["Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs"],"prefix":"10.1016","volume":"20","author":[{"given":"Hanif D.","family":"Sherali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny C.","family":"Myers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(88)90041-8_BIB1","series-title":"Mixed-integer bilinear programming problems","author":"Adams","year":"1983"},{"key":"10.1016\/0166-218X(88)90041-8_BIB2","series-title":"A tight linearization and an algorithm for solving zero-one quadratic programming problems","author":"Adams","year":"1984"},{"key":"10.1016\/0166-218X(88)90041-8_BIB3","series-title":"Nonlinear Programming: Theory and Applications","author":"Bazaraa","year":"1979"},{"key":"10.1016\/0166-218X(88)90041-8_BIB4","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/0377-2217(79)90228-5","article-title":"A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality","volume":"3","author":"Bazaraa","year":"1979","journal-title":"Europ. J. Oper. Res."},{"key":"10.1016\/0166-218X(88)90041-8_BIB5","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1016\/0377-2217(81)90096-5","article-title":"On the choice of step sizes in subgradient optimization","volume":"7","author":"Bazaraa","year":"1981","journal-title":"Europ. J. Oper. Res."},{"key":"10.1016\/0166-218X(88)90041-8_BIB6","first-page":"357","article-title":"On the solution of convex knapsack problems with bounded variables","author":"Bitran","year":"1976","journal-title":"Proc. of IX International Symposium on Mathematical Programming"},{"key":"10.1016\/0166-218X(88)90041-8_BIB7","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BFb0120697","article-title":"On improving relaxation methods by modified gradient techniques","volume":"3","author":"Camerini","year":"1975","journal-title":"Math. Programming Study"},{"issue":"5","key":"10.1016\/0166-218X(88)90041-8_BIB8","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","article-title":"Solving large-scale zero-one linear programming problems","volume":"31","author":"Crowder","year":"1983","journal-title":"Operations Research"},{"key":"10.1016\/0166-218X(88)90041-8_BIB9","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.26.6.992","article-title":"A dual-based procedure for uncapacitated facility location","volume":"26","author":"Erlenkotter","year":"1978","journal-title":"Operations Research"},{"key":"10.1016\/0166-218X(88)90041-8_BIB10","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1287\/mnsc.27.1.1","article-title":"The Lagrangean relaxation method for solving integer programming problems","volume":"27","author":"Fisher","year":"1981","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(88)90041-8_BIB11","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0305-0548(78)90018-7","article-title":"On obtaining the \u2018best\u2019 multipliers for a Lagrangean relaxation for integer programming","volume":"5","author":"Gavish","year":"1978","journal-title":"Computers and Operations Research"},{"key":"10.1016\/0166-218X(88)90041-8_BIB12","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","article-title":"Lagrangean relaxation for integer programming","volume":"2","author":"Geoffrion","year":"1974","journal-title":"Math. Programming Study"},{"key":"10.1016\/0166-218X(88)90041-8_BIB13","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","article-title":"The traveling salesman problem and minimum spanning trees","volume":"18","author":"Held","year":"1970","journal-title":"Operations Research"},{"key":"10.1016\/0166-218X(88)90041-8_BIB14","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The traveling salesman problem and minimum spanning trees","volume":"1","author":"Held","year":"1971","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(88)90041-8_BIB15","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","article-title":"Validation of subgradient optimization","volume":"1","author":"Held","year":"1974","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(88)90041-8_BIB16","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1145\/321062.321069","article-title":"Direct search solution of numerical and statistical problems","volume":"8","author":"Hooke","year":"1961","journal-title":"Assoc. Comput. Mach."},{"key":"10.1016\/0166-218X(88)90041-8_BIB17","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/BF02591907","article-title":"An aggregate subgradient method for nonsmooth convex minimization","volume":"27","author":"Kiwiel","year":"1983","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(88)90041-8_BIB18","article-title":"On a bundle algorithm for nonsmooth optimization","volume":"4","author":"Lemarechal","year":"1981"},{"key":"10.1016\/0166-218X(88)90041-8_BIB19","article-title":"On a bundle algorithm for nonsmooth optimization","author":"Martin","year":"1983","journal-title":"ORSA\/TIMS Meeting"},{"key":"10.1016\/0166-218X(88)90041-8_BIB20","series-title":"Ph.D. dissertation","article-title":"The design of branch and bound, Lagrangian relaxation and subgradient optimization strategies for mixed integer programming problems","author":"Myers","year":"1984"},{"key":"10.1016\/0166-218X(88)90041-8_BIB21","first-page":"593","article-title":"A general method of solving extremum problems","volume":"8","author":"Poljak","year":"1967","journal-title":"Soviet Math. Doklady"},{"key":"10.1016\/0166-218X(88)90041-8_BIB22","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0041-5553(69)90061-5","article-title":"Minimization of unsmooth functionals","volume":"9","author":"Poljak","year":"1969","journal-title":"U.S.S.R. Comput. Math. & Math. Physics"},{"issue":"1","key":"10.1016\/0166-218X(88)90041-8_BIB23","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/opre.32.1.52","article-title":"Surrogate dual multiplier search procedures in integer programming","volume":"32","author":"Rardin","year":"1984","journal-title":"Operations Research"},{"issue":"6","key":"10.1016\/0166-218X(88)90041-8_BIB24","doi-asserted-by":"crossref","first-page":"1169","DOI":"10.1287\/opre.24.6.1169","article-title":"Surrogate contraints and the strength of bounds derived from 0\u20131 Benders' partitioning procedures","volume":"24","author":"Rardin","year":"1976","journal-title":"Operations Research"},{"key":"10.1016\/0166-218X(88)90041-8_BIB25","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/363744.363779","article-title":"Construction of nonlinear programming test problems","volume":"8","author":"Rosen","year":"1965","journal-title":"Comm. ACM"},{"key":"10.1016\/0166-218X(88)90041-8_BIB26","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BFb0120703","article-title":"A method of conjugate subgradients for minimizing condifferentiable functions","volume":"3","author":"Wolfe","year":"1975","journal-title":"Math. Programming Study"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X88900418?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X88900418?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:53:59Z","timestamp":1555120439000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X88900418"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,5]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,5]]}},"alternative-id":["0166218X88900418"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(88)90041-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1988,5]]}}}