{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T09:11:57Z","timestamp":1773220317182,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1996,9]]},"DOI":"10.1016\/0167-6377(96)00019-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:03:44Z","timestamp":1027627424000},"page":"105-113","source":"Crossref","is-referenced-by-count":131,"title":["Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs"],"prefix":"10.1016","volume":"19","author":[{"given":"Hanif D.","family":"Sherali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gyunghyun","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(96)00019-3_BIB1","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01581249","article-title":"Mixed-integer bilinear programming problems","volume":"59","author":"Adams","year":"1993","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(96)00019-3_BIB2","series-title":"Nonlinear Programming: Theory and Algorithms","author":"Bazaraa","year":"1993"},{"key":"10.1016\/0167-6377(96)00019-3_BIB3","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"},{"key":"10.1016\/0167-6377(96)00019-3_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","article-title":"The Lagrangian relaxation method for solving integer programming problems","volume":"27","author":"Fisher","year":"1981","journal-title":"Management Sci."},{"key":"10.1016\/0167-6377(96)00019-3_BIB5","first-page":"82","article-title":"Lagrangian relaxation for integer programming","volume":"Vol. 2","author":"Geoffrion","year":"1974"},{"key":"10.1016\/0167-6377(96)00019-3_BIB6","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF01594925","article-title":"Convergence of a generalized subgradient method for nondifferentiable convex optimization","volume":"50","author":"Kim","year":"1991","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(96)00019-3_BIB7","article-title":"A primal convergence result for dual subgradient optimization with application to multi-commodity network flows","author":"Larsson","year":"1989","journal-title":"Research report, Dept. of Math., Linkoping Institute of Technology, Linkoping Institute of Technology, S-581 83"},{"key":"10.1016\/0167-6377(96)00019-3_BIB8","first-page":"593","article-title":"A general method for solving extremum problems","volume":"8","author":"Polyak","year":"1967","journal-title":"Soviet Math."},{"key":"10.1016\/0167-6377(96)00019-3_BIB9","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01580881","article-title":"A class of convergent primal-dual subgradient algorithms for decomposable convex programs","volume":"35","author":"Sen","year":"1986","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(96)00019-3_BIB10","series-title":"A variable target value method for nondifferentiable optimization","author":"Sherali","year":"1994"},{"key":"10.1016\/0167-6377(96)00019-3_BIB11","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1002\/1520-6750(199206)39:4<447::AID-NAV3220390403>3.0.CO;2-O","article-title":"A squared-Euclidean distance location-allocation problem","volume":"39","author":"Sherali","year":"1992","journal-title":"Naval Res. Logist."},{"key":"10.1016\/0167-6377(96)00019-3_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01100203","article-title":"A reformulation-convexification approach for solving nonconvex quadratic programming problems","volume":"7","author":"Sherali","year":"1995","journal-title":"J. Global Optim."},{"key":"10.1016\/0167-6377(96)00019-3_BIB13","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01447654","article-title":"A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems","volume":"20","author":"Sherali","year":"1989","journal-title":"Appl. Math. Optim."},{"key":"10.1016\/0167-6377(96)00019-3_BIB14","first-page":"116","article-title":"Minimization Methods for Nondifferentiable Functions","author":"Shor","year":"1985"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637796000193?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637796000193?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T05:55:49Z","timestamp":1555480549000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637796000193"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["0167637796000193"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(96)00019-3","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}