{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T14:31:08Z","timestamp":1761661868281},"reference-count":21,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"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":[[2002,12]]},"DOI":"10.1016\/s0167-6377(02)00166-9","type":"journal-article","created":{"date-parts":[[2002,10,21]],"date-time":"2002-10-21T15:29:59Z","timestamp":1035214199000},"page":"401-407","source":"Crossref","is-referenced-by-count":7,"title":["A nonlinear Lagrangian dual for integer programming"],"prefix":"10.1016","volume":"30","author":[{"given":"Yifan","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Duan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(02)00166-9_BIB1","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1287\/opre.25.3.419","article-title":"A convergent duality theory for integer programming","volume":"25","author":"Bell","year":"1977","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(02)00166-9_BIB2","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":"Manage Sci."},{"key":"10.1016\/S0167-6377(02)00166-9_BIB3","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","article-title":"Lagrangian relaxation for integer programming","volume":"2","author":"Geoffirion","year":"1974","journal-title":"Math. Programming Study"},{"key":"10.1016\/S0167-6377(02)00166-9_BIB4","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0893-9659(97)00075-X","article-title":"A sufficient and necessary condition for nonconvex constrained optimization","volume":"10","author":"Goh","year":"1997","journal-title":"Appl. Math. Lett."},{"key":"10.1016\/S0167-6377(02)00166-9_BIB5","first-page":"108","article-title":"Programmation entiere non lineaire","volume":"5","author":"Gondran","year":"1970","journal-title":"RAIRO, Theoretical Informatics and Applications"},{"key":"10.1016\/S0167-6377(02)00166-9_BIB6","first-page":"262","article-title":"Lagrangian decomposition","volume":"33","author":"Guignard","year":"1993","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(02)00166-9_BIB7","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1287\/mnsc.31.12.1533","article-title":"Branch and bound experiments in convex nonlinear integer programming","volume":"31","author":"Gupta","year":"1985","journal-title":"Manage Sci."},{"key":"10.1016\/S0167-6377(02)00166-9_BIB8","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF02192229","article-title":"Zero duality gap for a class of nonconvex optimization problem","volume":"85","author":"Li","year":"1995","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0167-6377(02)00166-9_BIB9","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0167-6377(99)00039-5","article-title":"Zero duality gap in integer programming","volume":"25","author":"Li","year":"1999","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(02)00166-9_BIB10","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1023\/A:1008325116400","article-title":"Success guarantee of dual search in integer programming","volume":"18","author":"Li","year":"2000","journal-title":"J. Global Optim."},{"key":"10.1016\/S0167-6377(02)00166-9_BIB11","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1023\/A:1019252306512","article-title":"pth power Lagrangian method for integer programming","volume":"98","author":"Li","year":"2000","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0167-6377(02)00166-9_BIB12","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/0166-218X(93)90014-F","article-title":"A primal dual integer programming algorithm","volume":"45","author":"Llewellyn","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-6377(02)00166-9_BIB13","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF01582893","article-title":"Lagrangian decomposition for integer nonlinear programming with linear constraints","volume":"52","author":"Michelon","year":"1991","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(02)00166-9_BIB14","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0166-218X(93)90049-T","article-title":"Lagrangian methods for 0\u20131 quadratic programming","volume":"42","author":"Michelon","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-6377(02)00166-9_BIB15","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0167-5060(08)70346-7","article-title":"A survey of Lagrangian techniques for discrete optimization","volume":"5","author":"Shapiro","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0167-6377(02)00166-9_BIB16","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1023\/A:1021736608968","article-title":"Value-estimation function method for constrained global optimization","volume":"102","author":"Sun","year":"1999","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0167-6377(02)00166-9_BIB17","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1287\/moor.25.4.625.12114","article-title":"Asymptotic strong duality bounded integer programming","volume":"25","author":"Sun","year":"2000","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0167-6377(02)00166-9_BIB18","series-title":"Optimization of System Reliability","author":"Tillman","year":"1980"},{"key":"10.1016\/S0167-6377(02)00166-9_BIB19","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1080\/00207728008967030","article-title":"Optimization of system reliability","volume":"11","author":"Tzafestas","year":"1980","journal-title":"Internat. J. Systems Sci."},{"key":"10.1016\/S0167-6377(02)00166-9_BIB20","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF02189998","article-title":"Duality in mathematics and linear and integer programming","volume":"90","author":"Williams","year":"1996","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0167-6377(02)00166-9_BIB21","first-page":"257","article-title":"Local saddle points and convexification for nonconvex optimization problems","volume":"90","author":"Xu","year":"1997","journal-title":"J. Optim. Theory Appl."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001669?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001669?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T22:54:46Z","timestamp":1554418486000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637702001669"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":21,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["S0167637702001669"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(02)00166-9","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}