{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:34:02Z","timestamp":1759847642738},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,2,22]],"date-time":"2014-02-22T00:00:00Z","timestamp":1393027200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s10107-014-0763-3","type":"journal-article","created":{"date-parts":[[2014,2,21]],"date-time":"2014-02-21T14:26:52Z","timestamp":1392992812000},"page":"491-509","source":"Crossref","is-referenced-by-count":16,"title":["On the augmented Lagrangian dual for integer programming"],"prefix":"10.1007","volume":"150","author":[{"given":"N. L.","family":"Boland","sequence":"first","affiliation":[]},{"given":"A. C.","family":"Eberhard","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,2,22]]},"reference":[{"key":"763_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-8149-3","volume-title":"Topologies on Closed and Closed Convex Sets, Mathematics and its Applications","author":"G Beer","year":"1993","unstructured":"Beer, G.: Topologies on Closed and Closed Convex Sets, Mathematics and its Applications, vol. 268. Kluwer Acad. Publ., Dordrecht (1993)"},{"key":"763_CR2","doi-asserted-by":"crossref","unstructured":"Benchimol, P., Desaulniers, G., Desrosiers, J.: Stabilized dynamic constraint aggregation for solving set partitioning problems. Eur. J. Oper. Res. 223(2), 360\u2013371 (2012)","DOI":"10.1016\/j.ejor.2012.07.004"},{"key":"763_CR3","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0012-365X(77)90028-0","volume":"19","author":"CE Blair","year":"1977","unstructured":"Blair, C.E., Jeroslow, R.: The value function in mixed integer programming 1. Discret. Math. 19, 121\u2013138 (1977)","journal-title":"Discret. Math."},{"key":"763_CR4","doi-asserted-by":"crossref","unstructured":"Bonami, P., Biegler, L.T., Conn, A.R., Cornujols, G., Grossmann, I.E., Laird, C.D., Lee, J., Lodi, A., Margot, F., Sawaya, N., W\u00e4chter, A.: An algorithmic framework for convex mixed integer nonlinear programs. Discret. Optim. 5(2), 186\u2013204 (2008)","DOI":"10.1016\/j.disopt.2006.10.011"},{"key":"763_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2010","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3, 1\u2013122 (2010)","journal-title":"Found. Trends Mach. Learn."},{"key":"763_CR6","doi-asserted-by":"crossref","first-page":"33","DOI":"10.3934\/jimo.2005.1.33","volume":"1","author":"R Burachik","year":"2005","unstructured":"Burachik, R., Rubinov, A.: On the absence of duality gap for Lagrangian-type functions. J. Indus. Manag. Optim. 1, 33\u201338 (2005)","journal-title":"J. Indus. Manag. Optim."},{"key":"763_CR7","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1137\/050647621","volume":"18","author":"R Burachik","year":"2007","unstructured":"Burachik, R., Rubinov, A.: Abstract convexity and augmented Lagrangians. SIAM J. Opt. 18, 413\u2013436 (2007)","journal-title":"SIAM J. Opt."},{"key":"763_CR8","doi-asserted-by":"crossref","unstructured":"Burachik, R., Kaya, Y.C.: A deflected subgradient algorithm using a general augumented Lagrangian duality with implications on penalty methods. In: Burachik, R.S., Yao, J.-C. (eds.), Variational Analysis and Generalized Differentiation in Optimization and Control, Springer Optim. Appl., 47, Springer, New York, pp. 109\u2013132 (2010)","DOI":"10.1007\/978-1-4419-0437-9_5"},{"key":"763_CR9","doi-asserted-by":"crossref","unstructured":"Bussieck, M.R., Vigerske, S.: MINLP solver software. In: Cochran, J.J., Cox, L.A., Keskinocak P., Kharoufeh, J.P., Cole Smith, J. (eds.) Wiley Encyclopedia of Operations Research and Management Science, pp. 1\u201312. Wiley, Hoboken (2011)","DOI":"10.1002\/9780470400531.eorms0527"},{"key":"763_CR10","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/978-3-540-68279-0_11","volume-title":"50 Years of Integer Programming: 1958\u20132008","author":"M Conforti","year":"2010","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Polyhedral approaches to mixed integer linear programming. In: J\u00fcnger, M., Liebling, T.M., Naddef, D., Nemhauser, G.L., Pulleyblank, W.R., Reinelt, G., Rinaldi, G., Wolsey, L.A. (eds.) 50 Years of Integer Programming: 1958\u20132008, pp. 343\u2013385. Springer, New York (2010)"},{"key":"763_CR11","first-page":"329349","volume":"9","author":"C DAmbrosio","year":"2011","unstructured":"DAmbrosio, C., Lodi, A.: Mixed integer nonlinear programming tools: a practical overview. 4OR 9, 329349 (2011)","journal-title":"4OR"},{"key":"763_CR12","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/s10107-012-0538-7","volume":"141","author":"SS Dey","year":"2013","unstructured":"Dey, S.S., Moran R, D.A.: Some properties of convex hulls of integer points contained in general convex sets. Math. Program. 141, 507\u2013526 (2013)","journal-title":"Math. Program."},{"key":"763_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/b135457","volume-title":"Column Generation","author":"G Desaulniers","year":"2005","unstructured":"Desaulniers, G., Desrosiers, J., Solomon, M.M.: Column Generation. Springer, Berlin (2005)"},{"key":"763_CR14","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein, J., Bertsekas, D.P.: On the Douglas\u2013Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55, 293\u2013318 (1992)","journal-title":"Math. Program."},{"issue":"2","key":"763_CR15","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s10107-008-0254-5","volume":"123","author":"I Elhallaoui","year":"2010","unstructured":"Elhallaoui, I., Metrane, A., Soumis, F., Desaulniers, G.: Multi-phase dynamic constraint aggregation for set partitioning type problems. Math. Program. 123(2), 345\u2013370 (2010)","journal-title":"Math. Program."},{"key":"763_CR16","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/S0377-2217(99)00171-X","volume":"124","author":"RD Galv\u00e3o","year":"2000","unstructured":"Galv\u00e3o, R.D., Espejo, L.G.A., Boffey, B.: A comparison of Lagrangian and surrogate relaxations for the maximal covering location problem. Eur. J. Oper. Res. 124, 377\u2013389 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"763_CR17","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"AM Geoffrion","year":"1974","unstructured":"Geoffrion, A.M.: Lagrangian relaxation for integer programming. Math. Program. Stud. 2, 82\u2013114 (1974)","journal-title":"Math. Program. Stud."},{"key":"763_CR18","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1287\/opre.13.6.879","volume":"13","author":"F Glover","year":"1965","unstructured":"Glover, F.: A multiphase-dual algorithm for the zero-one integer programming problem. Oper. Res. 13, 879\u2013919 (1965)","journal-title":"Oper. Res."},{"key":"763_CR19","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1287\/opre.23.3.434","volume":"23","author":"F Glover","year":"1975","unstructured":"Glover, F.: Surrogate constraint duality in mathematical programming. Oper. Res. 23, 434\u2013451 (1975)","journal-title":"Oper. Res."},{"key":"763_CR20","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","volume":"2","author":"R Gomory","year":"1969","unstructured":"Gomory, R.: Some polyhedra related to combinatorial problems. Linear Algeb. Appl. 2, 451\u2013558 (1969)","journal-title":"Linear Algeb. Appl."},{"key":"763_CR21","doi-asserted-by":"crossref","first-page":"924","DOI":"10.1287\/opre.18.5.924","volume":"18","author":"HJ Greenberg","year":"1970","unstructured":"Greenberg, H.J., Pierskalla, W.P.: Surrogate mathematical programming. Oper. Res. 18, 924\u2013939 (1970)","journal-title":"Oper. Res."},{"key":"763_CR22","volume-title":"Principles and Practice of Constraint Programming-CP96, LNCS","author":"JN Hooker","year":"1996","unstructured":"Hooker, J.N.: Inference duality as a basis for sensitivity analysis. In: Freudern, E.C. (ed.) Principles and Practice of Constraint Programming-CP96, LNCS. Springer, Berlin (1996)"},{"key":"763_CR23","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/B978-0-12-358350-5.50009-9","volume-title":"Mathematical Programming","author":"E Johnson","year":"1973","unstructured":"Johnson, E.: Cyclic groups, cutting planes and shortest path. In: Hu, T., Robinson, S. (eds.) Mathematical Programming, pp. 185\u2013211. Academic Press, New York (1973)"},{"key":"763_CR24","unstructured":"Johnson, E.: Integer Programming. In: CBMS-NSF Regional Conference Series in Applied Mathematics, ISBN: 978-0-8981-162-2, eISBN 978-1-61197-037-1, State University on New York, Buffalo (1980)"},{"issue":"1","key":"763_CR25","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/opre.32.1.52","volume":"32","author":"M Karwan","year":"1984","unstructured":"Karwan, M., Rardin, R.: Surrogate dual multiplier search procedures in integer programming. Oper. Res. 32(1), 52\u201369 (1984)","journal-title":"Oper. Res."},{"issue":"1","key":"763_CR26","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/BF01588253","volume":"17","author":"M Karwan","year":"1979","unstructured":"Karwan, M., Rardin, R.: Some relationships between Lagrangian and surrogate duality in integer programming. Math. Program. 17(1), 320\u2013334 (1979)","journal-title":"Math. Program."},{"key":"763_CR27","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1016\/j.ejor.2006.10.009","volume":"183","author":"D Klabjan","year":"2007","unstructured":"Klabjan, D.: Subadditive approaches in integer programming. Eur. J. Oper. Res. 183, 525\u2013545 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"763_CR28","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/j.disopt.2005.01.001","volume":"2","author":"JB Lasserre","year":"2005","unstructured":"Lasserre, J.B.: Generating functions and duality for integer programs. Discret. Optim. 2(1), 167\u2013187 (2005)","journal-title":"Discret. Optim."},{"key":"763_CR29","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1090\/conm\/374\/06903","volume":"374","author":"JB Lasserre","year":"2005","unstructured":"Lasserre, J.B.: Integer programming, duality and superadditive functions. Contemp. Math. 374, 139\u2013150 (2005)","journal-title":"Contemp. Math."},{"key":"763_CR30","volume-title":"Nonlinear Integer Programming, International Series in Operations Resarch & Management","author":"D Li","year":"2006","unstructured":"Li, D., Sun, X.: Nonlinear Integer Programming, International Series in Operations Resarch & Management. Springer, Berlin (2006)"},{"key":"763_CR31","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10898-006-9128-7","volume":"39","author":"D Li","year":"2007","unstructured":"Li, D., Wang, J., Sun, X.L.: Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method. J. Global Optim. 39, 127\u2013154 (2007)","journal-title":"J. Global Optim."},{"issue":"1\u20133","key":"763_CR32","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0012-365X(98)00213-1","volume":"194","author":"O Merle du","year":"1999","unstructured":"du Merle, O., Villeneuve, D., Desrosiers, J., Hansen, P.: Stabilized column generation. Discret. Math. 194(1\u20133), 229\u2013237 (1999)","journal-title":"Discret. Math."},{"key":"763_CR33","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF01585518","volume":"7","author":"RR Meyer","year":"1974","unstructured":"Meyer, R.R.: On the existence of optimal solutions to integer and mixed integer problems. Math. Program. 7, 223\u2013235 (1974)","journal-title":"Math. Program."},{"key":"763_CR34","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley-Interscience, London (1988)"},{"key":"763_CR35","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"763_CR36","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"1","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Augmented Lagrangians and applications of the proximal point algorithm in convex optimization. Math. Oper. Res. 1, 97\u2013116 (1976)","journal-title":"Math. Oper. Res."},{"key":"763_CR37","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T., Wets, R. J.-B.: Variational Analysis, A Series of Comprehensive Studies in Mathematics, vol. 317. Springer, Berlin (1998)","DOI":"10.1007\/978-3-642-02431-3"},{"key":"763_CR38","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1080\/16073606.1978.9631564","volume":"3","author":"M Sinclair","year":"1978\/79","unstructured":"Sinclair, M.: Augmented Lagrangean relaxations in general mixed integer programming. Quaestiones Math. 3, 115\u2013146 (1978\/79)","journal-title":"Quaestiones Math."},{"key":"763_CR39","doi-asserted-by":"crossref","first-page":"171","DOI":"10.2140\/pjm.1958.8.171","volume":"8","author":"M Sion","year":"1958","unstructured":"Sion, M.: On general minimax theorems. Pac. J. Math. 8, 171\u2013176 (1958)","journal-title":"Pac. J. Math."},{"key":"763_CR40","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01589344","volume":"20","author":"LA Wolsey","year":"1981","unstructured":"Wolsey, L.A.: Integer programming duality: price functions and sensitivity analysis. Math. Program. 20, 173\u2013195 (1981)","journal-title":"Math. Program."},{"key":"763_CR41","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1287\/moor.28.3.524.16389","volume":"28","author":"C Zalinescu","year":"2003","unstructured":"Zalinescu, C.: A nonlinear extension of Hoffman\u2019s error bound for linear inequalities. Math. Oper. Res. 28, 524\u2013532 (2003)","journal-title":"Math. Oper. Res."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0763-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-014-0763-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0763-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T17:22:53Z","timestamp":1565198573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-014-0763-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,22]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["763"],"URL":"https:\/\/doi.org\/10.1007\/s10107-014-0763-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,22]]}}}