{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T06:33:17Z","timestamp":1775716397341,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1987,6,1]],"date-time":"1987-06-01T00:00:00Z","timestamp":549504000000},"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":[[1987,6]]},"DOI":"10.1007\/bf02592954","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T16:12:13Z","timestamp":1175184733000},"page":"215-228","source":"Crossref","is-referenced-by-count":317,"title":["Lagrangean decomposition: A model yielding stronger lagrangean bounds"],"prefix":"10.1007","volume":"39","author":[{"given":"Monique","family":"Guignard","sequence":"first","affiliation":[]},{"given":"Siwhan","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1987,6,1]]},"reference":[{"key":"BF02592954_CR1","unstructured":"O. Bilde and J. Krarup, \u201cBestemmelse af optimal beliggenhed af produktionssteder\u201d Research Report, IMSOR, The Technical University of Denmark (1967)."},{"key":"BF02592954_CR2","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0167-5060(08)70728-3","volume":"1","author":"O. Bilde","year":"1977","unstructured":"O. Bilde and J. Krarup, \u201cSharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem,\u201dAnnals of Discrete Mathematics 1 (1977) 79\u201397.","journal-title":"Annals of Discrete Mathematics"},{"key":"BF02592954_CR3","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01581647","volume":"19","author":"M.E. Dyer","year":"1980","unstructured":"M.E. Dyer, \u201cCalculating Surrogate Constraints,\u201dMathematical Programming 19 (1980) 255\u2013278.","journal-title":"Mathematical Programming"},{"key":"BF02592954_CR4","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1287\/opre.26.6.992","volume":"26","author":"D. Erlenkotter","year":"1978","unstructured":"D. Erlenkotter, \u201cA Dual-Based Procedure for Uncapacitated Facility Location,\u201dOperations Research 26 (1978) 992\u20131009.","journal-title":"Operations Research"},{"key":"BF02592954_CR5","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1287\/mnsc.32.9.1095","volume":"32","author":"M.L. Fisher","year":"1986","unstructured":"M.L. Fisher, R. Jaikumar and L. Van Wassenhove, \u201cA Multiplier Adjustment Method for the Generalized Assignment Problem,\u201dManagement Science 32 (1986) 1095\u20131103.","journal-title":"Management Science"},{"key":"BF02592954_CR6","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/0196-6774(81)90032-8","volume":"2","author":"A. Frank","year":"1981","unstructured":"A. Frank, \u201cA Weighted Matroid Intersection Algorithm,\u201dJournal of Algorithms 2 (1981) 328\u2013336.","journal-title":"Journal of Algorithms"},{"key":"BF02592954_CR7","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/BF02591863","volume":"31","author":"B. Gavish","year":"1985","unstructured":"B. Gavish and H. Pirkul, \u201cEfficient Algorithms for Solving Multiconstraint Zero-One Knapsack Problems to Optimality,\u201dMathematical Programming 31 (1985) 78\u2013105.","journal-title":"Mathematical Programming"},{"key":"BF02592954_CR8","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"A. Geoffrion","year":"1974","unstructured":"A. Geoffrion, \u201cLagrangean Relaxation and its Uses in Integer Programming,\u201dMathematical Programming Study 2 (1974) 82\u2013114.","journal-title":"Mathematical Programming Study"},{"key":"BF02592954_CR9","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1287\/opre.28.3.829","volume":"28","author":"F. Glover","year":"1975","unstructured":"F. Glover and J. Mulvey, \u201cThe Equivalence of the 0\u20131 Integer Programming Problem to Discrete Generalized and Pure Network Models,\u201d Report HBS 75-46, Harvard University (1975), alsoOperations Research 28 (1980) 829\u2013933.","journal-title":"Operations Research"},{"key":"BF02592954_CR10","unstructured":"F. Glover and D. Klingman, \u201cLayering Strategies for Creating Exploitable Structure in Linear and Integer Programs,\u201d Center for Business Decision Analysis Report 119 (1984, revised 1985)."},{"key":"BF02592954_CR11","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1287\/opre.18.5.924","volume":"18","author":"H.J. Greenberg","year":"1970","unstructured":"H.J. Greenberg and W.P. Pierskalla, \u201cSurrogate Mathematical Programming,\u201dOperations Research 18 (1970) 924\u2013939.","journal-title":"Operations Research"},{"key":"BF02592954_CR12","unstructured":"M. Guignard, \u201cA Lagrangean Dual Ascent Method Based on (Separable) Relaxation Strengthened by Valid Inequalities (Illustrated for the Matching Problem),\u201d Department of Statistics Report #54, University of Pennsylvania (1983)."},{"key":"BF02592954_CR13","unstructured":"M. Guignard, \u201cA Lagrangean Dual Ascent Method for Simple Plant Location Problems,\u201d Department of Statistics Report #59, University of Pennsylvania (1984a), to appear inEuropean J. Oper. Res."},{"key":"BF02592954_CR14","unstructured":"M. Guignard, \u201cLagrangean Decomposition: An Improvement over Lagrangean and Surrogate Duals,\u201d Department of Statistics Report #62, University of Pennsylvania (1984b)."},{"key":"BF02592954_CR15","unstructured":"M. Guignard and S. Kim, \u201cA Strong Lagrangean Relaxation for Capacitated Plant Locations Problems,\u201d Department of Statistics Report #56, University of Pennsylvania (1983)."},{"key":"BF02592954_CR16","unstructured":"M. Guignard and K. Opaswongkarn, \u201cLagrangean Ascent for the Capacitated Plant Location Problem,\u201d Department of Statistics Report #57, University of Pennsylvania (1984)."},{"key":"BF02592954_CR17","unstructured":"M. Guignard and M. Rosenwein, \u201cAn Application of Lagrangean Decomposition to the Resource Constrained Minimum Weighted Arborescence Problem,\u201d AT&T Bell Laboratories Report (1987)."},{"key":"BF02592954_CR18","first-page":"239","volume":"49","author":"M. Guignard","year":"1985","unstructured":"M. Guignard and K. Spielberg \u201cSeparable Lagrangean Relaxation for Weakly-Linked Mixed Integer Programming Problems,\u201dMethods of Operations Research 49 (1985) 239\u2013253.","journal-title":"Methods of Operations Research"},{"key":"BF02592954_CR19","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1002\/net.3230100403","volume":"10","author":"G.Y. Handler","year":"1980","unstructured":"G.Y. Handler and I. Zang, \u201cA Dual Algorithm for the Constrained Shortest Path Problem,\u201dNetworks 10 (1980) 293\u2013310.","journal-title":"Networks"},{"key":"BF02592954_CR20","series-title":"Department of Mathematics Report LiTHMAT-R-85-04","volume-title":"Variable splitting\u2014A New Lagrangean Relaxation Approach to Some Mathematical Programming Models","author":"K.O. J\u00f6rnsten","year":"1985","unstructured":"K.O. J\u00f6rnsten, M. N\u00e4sberg and P.A. Smeds, \u201cVariable splitting\u2014A New Lagrangean Relaxation Approach to Some Mathematical Programming Models,\u201d Department of Mathematics Report LiTHMAT-R-85-04, Link\u00f6ping Institute of Technology, Sweden (1985)."},{"key":"BF02592954_CR21","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/BF01588253","volume":"18","author":"M.H. Karwan","year":"1979","unstructured":"M.H. Karwan and R.L. Rardin, \u201cSome Relationships between Lagrangean and Surrogate Duality in Integer Programming,\u201dMathematical Programming 18 (1979) 320\u2013334.","journal-title":"Mathematical Programming"},{"key":"BF02592954_CR22","unstructured":"S. Kim, oral communication (1984)."},{"key":"BF02592954_CR23","unstructured":"S. Kim, \u201cSolving Single Side Constraint Problems in Integer Programming: the Inequality Case,\u201d Department of Statistics, Report #60, University of Pennsylvania (1984)."},{"key":"BF02592954_CR24","unstructured":"S. Kim, \u201cPrimal Interpretation of Lagrangean Decomposition\u201d Department of Statistics Report #72, University of Pennsylvania (1985)."},{"key":"BF02592954_CR25","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF03004231","volume":"30","author":"M. Minoux","year":"1975","unstructured":"M. Minoux, \u201cPlus courts chemins avec contraintes: algorithmes et applications,\u201dAnnales des T\u00e9l\u00e9communications 30 (1975) 383\u2013394.","journal-title":"Annales des T\u00e9l\u00e9communications"},{"key":"BF02592954_CR26","unstructured":"M. Minoux, \u201cLagrangean Decomposition,\u201d oral communication (1983)."},{"key":"BF02592954_CR27","unstructured":"C. Ribeiro, \u201cAlgorithmes de Recherche de Plus Courts Chemins avec Contraintes: Etude Th\u00e9orique, Impl\u00e9mentation et Parall\u00e9lisation,\u201d Doctoral Dissertation, Paris (1983)."},{"key":"BF02592954_CR28","unstructured":"C. Ribeiro and M. Minoux, \u201cSolving Hard Constrained Shortest Path Problems,\u201d ORSA-TIMS Meeting, Dallas (1984)."},{"key":"BF02592954_CR29","first-page":"303","volume":"53","author":"C. Ribeiro","year":"1986","unstructured":"C. Ribeiro and M. Minoux, \u201cSolving Hard Constrained Shortest Path Problems by Lagrangean Relaxation and Branch and Bound Algorithms,\u201dMethods of Operations Research 53 (1986) 303\u2013316.","journal-title":"Methods of Operations Research"},{"key":"BF02592954_CR30","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1287\/mnsc.26.3.274","volume":"26","author":"F. Shepardson","year":"1980","unstructured":"F. Shepardson and R. Marsten, \u201cA Lagrangean Relaxation Algorithm for the Two-Duty Period Scheduling Problem,\u201dManagement Science 26 (1980) 274\u2013281.","journal-title":"Management Science"},{"key":"BF02592954_CR31","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF02612335","volume":"28","author":"R. Wong","year":"1984","unstructured":"R. Wong, \u201cA Dual Ascent Approach for Steiner Tree Problems on a Directed Graph,\u201dMathematical Programming 28 (1984) 271\u2013287.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592954.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02592954\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592954","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592954.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T22:07:38Z","timestamp":1628719658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02592954"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,6]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,6]]}},"alternative-id":["BF02592954"],"URL":"https:\/\/doi.org\/10.1007\/bf02592954","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,6]]}}}