{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T11:47:34Z","timestamp":1778586454884,"version":"3.51.4"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,12,12]],"date-time":"2006-12-12T00:00:00Z","timestamp":1165881600000},"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":[[2008,6]]},"DOI":"10.1007\/s10107-006-0079-z","type":"journal-article","created":{"date-parts":[[2006,12,11]],"date-time":"2006-12-11T20:06:18Z","timestamp":1165867578000},"page":"299-344","source":"Crossref","is-referenced-by-count":77,"title":["Comparison of bundle and classical column generation"],"prefix":"10.1007","volume":"113","author":[{"given":"O.","family":"Briant","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Lemar\u00e9chal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ph.","family":"Meurdesoif","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Michel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Perrot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Vanderbeck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,12,12]]},"reference":[{"key":"79_CR1","unstructured":"Anstreicher, K., Wolsey, L.A.: On Dual Solutions in Subgradient Optimization. Unpublished manuscript, CORE, Louvain-la-Neuve (1993)"},{"key":"79_CR2","unstructured":"Augerat, P.: VRP problem instances (1995) http:\/\/www.branchandcut.org\/VRP\/data\/"},{"issue":"3","key":"79_CR3","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"F. Barahona","year":"2000","unstructured":"Barahona F. and Anbil R. (2000). The volume algorithm: Producing primal solutions with a subgradient method. Math. Program. 87(3): 385\u2013399","journal-title":"Math. Program."},{"key":"79_CR4","doi-asserted-by":"crossref","unstructured":"Beasley, J.E.: Or-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069\u20131072 (1990) http:\/\/mscmga.ms.ic.ac.uk\/jeb\/orlib\/binpackinfo.html","DOI":"10.1057\/jors.1990.166"},{"key":"79_CR5","unstructured":"Ben-Amor, H., Desrosiers, J.: A proximal-like algorithm for column generation stabilization. Technical report G-2003-43, Les Cahiers du Gerad, Montr\u00e9al (2003)"},{"key":"79_CR6","doi-asserted-by":"crossref","unstructured":"Benameur, W., Neto, J.: Acceleration of cutting plane and column generation algorithms: application to network design (to appear, 2006)","DOI":"10.1002\/net.20137"},{"key":"79_CR7","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF01386389","volume":"1","author":"E. Cheney","year":"1959","unstructured":"Cheney E. and Goldstein A. (1959). Newton\u2019s method for convex programming and Tchebycheff approximations. Numer. Math. 1: 253\u2013268","journal-title":"Numer. Math."},{"key":"79_CR8","unstructured":"COmputational INfrastructure for Operations Research: http:\/\/www.coin-or.org"},{"key":"79_CR9","unstructured":"Dash Optimization: Xpress-MP: User guide and reference manual, release 12 (2001) http:\/\/www.dashoptimization.com"},{"issue":"1\u20133","key":"79_CR10","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1287\/ijoc.15.1.58.15156","volume":"15","author":"Z. Degraeve","year":"2003","unstructured":"Degraeve Z. and Peeters M. (2003). Optimal integer solutions to industrial cutting stock problems: part 2: benchmark results. INFORMS J. Comput. 15(1\u20133): 58\u201381","journal-title":"INFORMS J. Comput."},{"issue":"1\u20133","key":"79_CR11","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0012-365X(98)00213-1","volume":"194","author":"O. du Merle","year":"1999","unstructured":"du Merle O., Villeneuve D., Desrosiers J. and Hansen P. (1999). Stabilized column generation. Disc. Math. 194(1\u20133): 229\u2013237","journal-title":"Disc. Math."},{"issue":"4","key":"79_CR12","first-page":"1","volume":"2","author":"Y.M. Ermol\u2019ev","year":"1966","unstructured":"Ermol\u2019ev Y.M. (1966). Methods of solution of nonlinear extremal problems. Kibernetica 2(4): 1\u201317","journal-title":"Kibernetica"},{"issue":"3","key":"79_CR13","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/net.20033","volume":"44","author":"D. Feillet","year":"2004","unstructured":"Feillet D., Dejax P., Gendreau M. and Gueguen C. (2004). An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 44(3): 216\u2013229","journal-title":"Networks"},{"issue":"1","key":"79_CR14","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1137\/S1052623498342186","volume":"13","author":"A. Frangioni","year":"2003","unstructured":"Frangioni A. (2003). Generalized bundle methods. SIAM J. Optim. 13(1): 117\u2013156","journal-title":"SIAM J. Optim."},{"key":"79_CR15","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1016\/0377-2217(95)00023-J","volume":"84","author":"T. Gau","year":"1995","unstructured":"Gau T. and W\u00e4scher G. (1995). CUTGEN1: a problem generator for the standard one-dimensional cutting stock problem. Eur. J. Oper. Res. 84: 572\u2013579","journal-title":"Eur. J. Oper. Res."},{"key":"79_CR16","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"A.M. Geoffrion","year":"1974","unstructured":"Geoffrion A.M. (1974). Lagrangean relaxation for integer programming. Math. Program. Study 2: 82\u2013114","journal-title":"Math. Program. Study"},{"issue":"2","key":"79_CR17","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1287\/mnsc.38.2.284","volume":"38","author":"J.-L. Goffin","year":"1992","unstructured":"Goffin J.-L., Haurie A. and Vial J.-Ph. (1992). Decomposition and nondifferentiable optimization with the projective algorithm. Manage. Sci. 38(2): 284\u2013302","journal-title":"Manage. Sci."},{"issue":"3","key":"79_CR18","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1137\/S1052623493258635","volume":"6","author":"J.-L. Goffin","year":"1996","unstructured":"Goffin J.-L., Luo Z.-Q. and Ye Y. (1996). Complexity analysis of an interior cutting plane for convex feasibility problems. SIAM J. Optim. 6(3): 638\u2013652","journal-title":"SIAM J. Optim."},{"issue":"5","key":"79_CR19","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1080\/1055678021000060829a","volume":"17","author":"J.-L. Goffin","year":"2002","unstructured":"Goffin J.-L. and Vial J.-Ph. (2002). Convex nondifferentiable optimization: a survey focused on the analytic center cutting plane method. Optim. Methods Softw. 17(5): 805\u2013867","journal-title":"Optim. Methods Softw."},{"key":"79_CR20","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M. Held","year":"1970","unstructured":"Held M. and Karp R. (1970). The traveling salesman problem and minimum spanning trees. Oper. Res. 18: 1138\u20131162","journal-title":"Oper. Res."},{"issue":"1","key":"79_CR21","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M. Held","year":"1971","unstructured":"Held M. and Karp R. (1971). The traveling salesman problem and minimum spanning trees: part II. Math. Program. 1(1): 6\u201325","journal-title":"Math. Program."},{"key":"79_CR22","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms. Springer, Berlin Heidelberg New York (1993, Two volumes)","DOI":"10.1007\/978-3-662-02796-7"},{"key":"79_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56468-0","volume-title":"Fundamentals of Convex Analysis","author":"J.-B. Hiriart-Urruty","year":"2001","unstructured":"Hiriart-Urruty J.-B. and Lemar\u00e9chal C. (2001). Fundamentals of Convex Analysis. Springer, Berlin Heidelberg New York"},{"key":"79_CR24","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0108053","volume":"8","author":"J.E. Kelley","year":"1960","unstructured":"Kelley J.E. (1960). The cutting plane method for solving convex programs. J. Soc. Indust. Appl. Math. 8: 703\u2013712","journal-title":"J. Soc. Indust. Appl. Math."},{"issue":"1","key":"79_CR25","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF01592242","volume":"71","author":"S. Kim","year":"1995","unstructured":"Kim S., Chang K.N. and Lee J.Y. (1995). A descent method with linear programming subproblems for nondifferentiable convex optimization. Math. Program. 71(1): 17\u201328","journal-title":"Math. Program."},{"issue":"1","key":"79_CR26","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1137\/0910013","volume":"10","author":"K.C. Kiwiel","year":"1989","unstructured":"Kiwiel K.C. (1989). A dual method for certain positive semidefinite quadratic programming problems. SIAM J. Sci. Stat. Comput. 10(1): 175\u2013186","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"79_CR27","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/BF02591907","volume":"27","author":"K.C. Kiwiel","year":"1983","unstructured":"Kiwiel K.C. (1983). An aggregate subgradient method for nonsmooth convex minimization. Math. Program. 27: 320\u2013341","journal-title":"Math. Program."},{"key":"79_CR28","volume-title":"Methods of Descent for Nondifferentiable Optimization. Lecture Notes in Mathematics 1133","author":"K.C. Kiwiel","year":"1985","unstructured":"Kiwiel K.C. (1985). Methods of Descent for Nondifferentiable Optimization. Lecture Notes in Mathematics 1133. Springer, Berlin Heidelberg New York"},{"key":"79_CR29","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s002110050065","volume":"68","author":"K.C. Kiwiel","year":"1994","unstructured":"Kiwiel K.C. (1994). A Cholesky dual method for proximal piecewise linear programming. Numer. Math. 68: 325\u2013340","journal-title":"Numer. Math."},{"key":"79_CR30","unstructured":"Kiwiel, K.C.: An inexact bundle approach to cutting stock problems. Technical report, Systems Research Institute, Warsaw. Submitted to INFORMS J. Comput. (2004)"},{"issue":"4","key":"79_CR31","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1137\/040603929","volume":"16","author":"K.C. Kiwiel","year":"2006","unstructured":"Kiwiel K.C. (2006). A proximal bundle method with approximate subgradient linearizations. SIAM J. Optim. 16(4): 1007\u20131023","journal-title":"SIAM J. Optim."},{"key":"79_CR32","unstructured":"Kiwiel, K.C., Lemar\u00e9chal, C.: An inexact conic bundle variant suited to column generation (in preparation)"},{"issue":"1","key":"79_CR33","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s10107-002-0357-3","volume":"94","author":"C. Sagastiz\u00e1bal","year":"2002","unstructured":"Sagastiz\u00e1bal C., Bahiense L. and Maculan N. (2002). The volume algorithm revisited: relation with bundle methods. Math. Program. 94(1): 41\u201369","journal-title":"Math. Program."},{"issue":"2","key":"79_CR34","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s101070050090","volume":"86","author":"T. Larsson","year":"1999","unstructured":"Larsson T., Patriksson M. and Str\u00f6mberg A.B. (1999). Ergodic, primal convergence in dual subgradient schemes for convex programming. Math. Program. 86(2): 283\u2013312","journal-title":"Math. Program."},{"key":"79_CR35","unstructured":"Lemar\u00e9chal, C.: An algorithm for minimizing convex functions. In: Rosenfeld, J.L. (ed.) Information Processing \u201974, pp. 552\u2013556. North Holland, Amsterdam (1974)"},{"key":"79_CR36","unstructured":"Lemar\u00e9chal, C.: Nonsmooth optimization and descent methods. Research Report 78-4, IIASA (1978)"},{"key":"79_CR37","doi-asserted-by":"crossref","unstructured":"Lemar\u00e9chal, C.: Lagrangian relaxation. In: J\u00fcnger, M., Naddef, D. (eds.) Computational Combinatorial Optimization, pp. 112\u2013156. Springer, Berlin Heidelberg New York (2001)","DOI":"10.1007\/3-540-45586-8_4"},{"key":"79_CR38","doi-asserted-by":"crossref","unstructured":"Lemar\u00e9chal, C.: The omnipresence of Lagrange. 4OR 1(1), 7,25 (2003)","DOI":"10.1007\/s10288-002-0003-1"},{"key":"79_CR39","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01585555","volume":"69","author":"C. Lemar\u00e9chal","year":"1995","unstructured":"Lemar\u00e9chal C., Nemirovskii A.S. and Nesterov Yu.E. (1995). New variants of bundle methods. Math. Program. 69: 111\u2013148","journal-title":"Math. Program."},{"key":"79_CR40","doi-asserted-by":"crossref","unstructured":"Lemar\u00e9chal, C., Pellegrino, F., Renaud, A., Sagastiz\u00e1bal, C.: Bundle methods applied to the unit-commitment problem. In: Dole\u017e al, J., Fidler, J. (eds.) System Modelling and Optimization, pp. 395\u2013402. Chapman and Hall, London (1996)","DOI":"10.1007\/978-0-387-34897-1_47"},{"issue":"3","key":"79_CR41","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/BF02614390","volume":"76","author":"C. Lemar\u00e9chal","year":"1997","unstructured":"Lemar\u00e9chal C. and Sagastiz\u00e1bal C. (1997). Variable metric bundle methods: from conceptual to implementable forms. Math. Program. 76(3): 393\u2013410","journal-title":"Math. Program."},{"issue":"3","key":"79_CR42","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1287\/opre.23.3.389","volume":"23","author":"R.E. Marsten","year":"1975","unstructured":"Marsten R.E., Hogan W.W. and Blankenship J.W. (1975). The boxstep method for large-scale optimization. Oper. Res. 23(3): 389\u2013405","journal-title":"Oper. Res."},{"issue":"4","key":"79_CR43","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/ijoc.8.4.344","volume":"8","author":"A. Mehrotra","year":"1996","unstructured":"Mehrotra A. and Trick M.A. (1996). A column generation approach to graph coloring. INFORMS J. Comput. 8(4): 344\u2013354","journal-title":"INFORMS J. Comput."},{"key":"79_CR44","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0012-365X(98)00213-1","volume":"194","author":"O. du Merle","year":"1999","unstructured":"du Merle O., Villeneuve D., Desrosiers J. and Hansen P. (1999). Stabilized column generation. Discrete Math. 194: 229\u2013237","journal-title":"Discrete Math."},{"key":"79_CR45","unstructured":"Nemirovskii, A.S., Yudin, D.: Informational complexity and efficient methods for the solution of convex extremal problems. \u00c9konomika i Mathematicheskie Metody 12, 357\u2013369 (1976) (in Russian. English translation: Matekon 13, 3\u201325)"},{"key":"79_CR46","unstructured":"Nemirovskii, A.S., Yudin, D.: Problem Complexity and Method Efficiency in Optimization. Wiley-Interscience Series in Discrete Mathematics (1983). (Original Russian: Nauka, 1979)"},{"issue":"1","key":"79_CR47","first-page":"149","volume":"69","author":"Yu.E. Nesterov","year":"1995","unstructured":"Nesterov Yu.E. (1995). Complexity estimates of some cutting plane methods based on the analytic barrier. Math. Program. 69(1): 149\u2013176","journal-title":"Math. Program."},{"issue":"3","key":"79_CR48","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1137\/S1052623497324813","volume":"9","author":"Yu.E. Nesterov","year":"1999","unstructured":"Nesterov Yu.E. and Vial J.-Ph. (1999). Homogeneous analytic center cutting plane methods for convex problems and variational inequalities. SIAM J. Optim. 9(3): 707\u2013728","journal-title":"SIAM J. Optim."},{"key":"79_CR49","first-page":"593","volume":"8","author":"B.T. Polyak","year":"1967","unstructured":"Polyak B.T. (1967). A general method for solving extremum problems. Soviet Math. Doklady 8: 593\u2013597","journal-title":"Soviet Math. Doklady"},{"key":"79_CR50","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"Prim R.C. (1957). Shortest connection networks and some generalizations. Bell Syst. Technol. J. 36: 1389\u20131401","journal-title":"Bell Syst. Technol. J."},{"key":"79_CR51","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"Rockafellar R.T. (1970). Convex Analysis. Princeton University Press, Princeton"},{"key":"79_CR52","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF01580138","volume":"5","author":"R.T. Rockafellar","year":"1973","unstructured":"Rockafellar R.T. (1973). A dual approach to solving nonlinear programming problems by constrained optimization. Math. Program. 5: 354\u2013373","journal-title":"Math. Program."},{"key":"79_CR53","unstructured":"Rousseau, L.-M., Gendreau, M., Feillet, D.: Interior point stabilization for column generation. Working paper 39, Centre de Recherche sur les Transports, Univ. Montr\u00e9al (2003)"},{"issue":"1","key":"79_CR54","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF02341816","volume":"6","author":"N. Shor","year":"1970","unstructured":"Shor N. (1970). Utilization of the operation of space dilatation in the minimization of convex functions. Cybernetics 6(1): 7\u201315","journal-title":"Cybernetics"},{"key":"79_CR55","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-82118-9","volume-title":"Minimization methods for non-differentiable functions","author":"N.Z. Shor","year":"1985","unstructured":"Shor N.Z. (1985). Minimization methods for non-differentiable functions. Springer, Berlin Heidelberg New York"},{"issue":"1","key":"79_CR56","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s10479-005-3454-x","volume":"139","author":"B. Thiongane","year":"2004","unstructured":"Thiongane B., Nagih A. and Plateau G. (2004). Adapted step size in a 0-1 biknapsack lagrangean dual solving algoritm. Ann. Oper. Res. 139(1): 353\u2013373","journal-title":"Ann. Oper. Res."},{"key":"79_CR57","unstructured":"Uzawa, H.: Iterative methods for concave programming. In: Arrow, K., Hurwicz, L., Uzawa, H. (eds.) Studies in Linear and Nonlinear Programming, pp. 154\u2013165. Stanford University Press, Stanford (1959)"},{"issue":"1","key":"79_CR58","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-002-0300-7","volume":"94","author":"F. Vanderbeck","year":"2002","unstructured":"Vanderbeck F. (2002). Extending Dantzig\u2019s bound to the bounded multi-class binary knapsack problem. Math. Program. 94(1): 125\u201316","journal-title":"Math. Program."},{"key":"79_CR59","unstructured":"Vanderbeck, F.: Dantzig-Wolfe re-formulation or how to exploit simultaneaously original formulation and column generation re-formulation. Working paper U-03.24, University Bordeaux 1, Talence (2003)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0079-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-006-0079-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0079-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:02Z","timestamp":1559123402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-006-0079-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12,12]]},"references-count":59,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["79"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0079-z","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12,12]]}}}