{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T00:34:44Z","timestamp":1776990884368,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":98,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540682745","type":"print"},{"value":"9783540682790","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,11,6]],"date-time":"2009-11-06T00:00:00Z","timestamp":1257465600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-540-68279-0_13","type":"book-chapter","created":{"date-parts":[[2009,11,6]],"date-time":"2009-11-06T14:18:28Z","timestamp":1257517108000},"page":"431-502","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":78,"title":["Reformulation and Decomposition of Integer Programs"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Vanderbeck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurence A.","family":"Wolsey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,11,6]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1287\/moor.1040.0099","volume":"29","author":"K. Aardal","year":"2004","unstructured":"K. Aardal and A.K. Lenstra, Hard equality constrained integer knapsacks, Erratum: Mathematics of Operations Research 31, 2006, page 846, Mathematics of Operations Research 29 (2004) 724\u2013738.","journal-title":"Mathematics of Operations Research"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1287\/opre.37.5.716","volume":"37","author":"A. Balakrishnan","year":"1989","unstructured":"A. Balakrishnan, T.L. Magnanti, and R.T. Wong, A dual ascent procedure for large-scale uncapacitated network design, Operations Research 37 (1989) 716\u2013740.","journal-title":"Operations Research"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0166-218X(98)00096-1","volume":"89","author":"E. Balas","year":"1998","unstructured":"E. Balas, Disjunctive programming: properties of the convex hull of feasible points, originally as GSIA Management Science Research Report MSRR 348, Carnegie Mellon University, 1974, Discrete Applied Mathematics 89 (1998) 1\u201344.","journal-title":"Discrete Applied Mathematics"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1002\/net.3230130405","volume":"13","author":"E. Balas","year":"1983","unstructured":"E. Balas and W.R. Pulleyblank, The perfectly matchable subgraph polytope of a bipartite graph, Networks 13 (1983) 495\u2013516.","journal-title":"Networks"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"F. Barahona","year":"2000","unstructured":"F. Barahona and R. Anbil, The volume algorithm: Producing primal solutions with a subgradient method, Mathematical Programming 87 (2000) 385\u2013399.","journal-title":"Mathematical Programming"},{"key":"13_CR6","first-page":"1074","volume":"28","author":"J.J. Bartholdi","year":"1980","unstructured":"J.J. Bartholdi, J.B. Orlin, and H. Ratliff, Cyclic scheduling via integer programs with circular ones, Mathematical Programming 28 (1980) 1074\u20131085.","journal-title":"Mathematical Programming"},{"key":"13_CR7","unstructured":"G. Belov, A.N. Letchford, and E. Uchoa, A node-flow model for the 1D stock cutting: robust branch-cut-and-price, Tech. report, University of Lancaster, 2005."},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1016\/j.dam.2008.06.021","volume":"157","author":"H. Ben Amor","year":"2009","unstructured":"H. Ben Amor, J. Desrosiers, and A. Frangioni, On the choice of explicit stabilizing terms in column generation, Discrete Applied Mathematics 157 (2009) 1167\u20131184.","journal-title":"Discrete Applied Mathematics"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J.F. Benders","year":"1962","unstructured":"J.F. Benders, Partitioning procedures for solving mixed variables programming problems, Numerische Mathematik 4 (1962) 238\u2013252.","journal-title":"Numerische Mathematik"},{"key":"13_CR10","unstructured":"D. Bienstock and B.McClosky, Tightening simple mixed-integer sets with guaranteed bounds, Tech. report, Columbia University, New York, July 2008."},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"O. Bilde and J. Krarup, Plant location, set covering and economic lot sizes: An O(mn) algorithm for structured problems, Optimierung bei Graphentheoretischen und Ganzzahligen Probleme (L. Collatz et al., ed.), Birkhauser Verlag, Basel, 1977, pp. 155\u2013180.","DOI":"10.1007\/978-3-0348-5936-3_10"},{"key":"13_CR12","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, Sharp lower bounds and efficient algorithms for the simple plant location problem, Annals of Discrete Mathematics 1 (1977) 79\u201397.","journal-title":"Annals of Discrete Mathematics"},{"key":"13_CR13","unstructured":"R. Bornd\u00f6rfer, A. L\u00f6bel, and S. Weider, A bundle method for integrated multi-depot vehicle and duty scheduling in public transit, ZIB Report 04-14, Konrad-Zuse Zentrum, Berlin, 2004."},{"key":"13_CR14","unstructured":"R. Bornd\u00f6rfer, U. Schelten, T. Schlechter, and S. Weider, A column generation approach to airline crew scheduling, ZIB Report 05-37, Konrad-Zuse Zentrum, Berlin, 2005."},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF01585527","volume":"7","author":"G.H. Bradley","year":"1974","unstructured":"G.H. Bradley, P.L. Hammer, and L.A. Wolsey, Coefficent reduction for inequalities in 0-1 variables, Mathematical Programming 7 (1974) 263\u2013282.","journal-title":"Mathematical Programming"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10107-006-0079-z","volume":"113","author":"O. Briant","year":"2008","unstructured":"O. Briant, C. Lemar\u00e9chal, Ph. Meurdesoif, S. Michel, N. Perrot, and F. Vanderbeck, Comparison of bundle and classical column generation, Mathematical Programming 113 (2008) 299\u2013344.","journal-title":"Mathematical Programming"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/j.endm.2005.05.045","volume":"19","author":"M. Camp\u00ealo","year":"2005","unstructured":"M. Camp\u00ealo, V. Campos, and R. Corr\u00e9a, On the asymmetric representatives formulation for the vertex coloring problem, Notes in Discrete Mathematics 19 (2005) 337\u2013343.","journal-title":"Notes in Discrete Mathematics"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BF01386389","volume":"1","author":"E. Cheney","year":"1959","unstructured":"E. Cheney and A. Goldstein, Newton\u2019s method for convex programming and Tchebycheff approximations, Numerische Mathematik 1 (1959) 253\u2013268.","journal-title":"Numerische Mathematik"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1287\/moor.1080.0354","volume":"34","author":"M. Conforti","year":"2009","unstructured":"M. Conforti, M. Di Summa, F. Eisenbrand, and L.A. Wolsey, Network formulations of mixed integer programs, Mathematics of Operations Research 34 (2009) 194\u2013209.","journal-title":"Mathematics of Operations Research"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10107-007-0101-0","volume":"114","author":"M. Conforti","year":"2008","unstructured":"M. Conforti and L.A. Wolsey, Compact formulations as a union of polyhedra, Mathematical Programming 114 (2008) 277\u2013289.","journal-title":"Mathematical Programming"},{"key":"13_CR21","unstructured":"M. Conforti, L.A. Wolsey, and G. Zambelli, Projecting an extended formulation for mixed integer covers on bipartite graphs, Tech. report, University of Padua, November 2008."},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"G.B. Dantzig","year":"1960","unstructured":"G.B. Dantzig and P.Wolfe, Decomposition principle for linear programs, Operations Research 8 (1960) 101\u2013111.","journal-title":"Operations Research"},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1023\/A:1018952112615","volume":"86","author":"J.V. Carvalho de","year":"1999","unstructured":"J.V. de Carvalho, Exact solution of bin packing problems using column generation and branchand-bound, Annals of Opererations Research 86 (1999) 629\u2013659.","journal-title":"Annals of Opererations Research"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"J. Desrosiers, Y. Dumas, M.M. Solomon, and F. Soumis, Time constrained routing and scheduling, Network Routing (C.L. Monma M.O. Ball, T.L. Magnanti and G.L. Nemhauser, eds.), Handbooks in Operations Research and Management Science, Vol. 8, Elsevier, 1995.","DOI":"10.1016\/S0927-0507(05)80106-9"},{"key":"13_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.23.1.1","volume":"23","author":"J. Desrosiers","year":"1989","unstructured":"J. Desrosiers and F. Soumis, A column generation approach to the urban transit crew scheduling problem, Transportation Science 23 (1989) 1\u201313.","journal-title":"Transportation Science"},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1002\/net.3230140406","volume":"14","author":"J. Desrosiers","year":"1984","unstructured":"J. Desrosiers, F. Soumis, and M. Desrochers, Routing with time windows by column generation, Networks 14 (1984) 545\u2013565.","journal-title":"Networks"},{"key":"13_CR27","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0012-365X(98)00213-1","volume":"194","author":"O. Merle Du","year":"1999","unstructured":"O. Du Merle, D. Villeneuve, J. Desrosiers, and P. Hansen, Stabilized column generation, Discrete Mathematics 194 (1999) 229\u2013237.","journal-title":"Discrete Mathematics"},{"key":"13_CR28","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1287\/mnsc.11.9.874","volume":"11","author":"B. Dzielinski","year":"1965","unstructured":"B. Dzielinski and R. Gomory, Optimal programming of lot-sizes, inventories and labor allocations, Management Science 11 (1965) 874\u2013890.","journal-title":"Management Science"},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"F. Eisenbrand, G. Oriolo, G. Stauffer, and P. Ventura, Circular ones matrices and the stable set polytope of quasi-line graphs, Integer Programming and Combinatorial Optimization, IPCO 2005 (M. J\u00fcnger and V. Kaibel, eds.), Lecture Notes in Computer Science 3509, Springer, 2005, pp. 291\u2013305.","DOI":"10.1007\/11496915_22"},{"key":"13_CR30","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/j.orl.2005.09.008","volume":"34","author":"F. Eisenbrand","year":"2006","unstructured":"F. Eisenbrand and G. Shmonin, Carath\u00e9odory bounds for integer cones, Operations Research Letters 34 (2006) 564\u2013568.","journal-title":"Operations Research Letters"},{"key":"13_CR31","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1287\/opre.1050.0222","volume":"53","author":"I. Elhallaoui","year":"2005","unstructured":"I. Elhallaoui, D. Villeneuve, F. Soumis, and G. Desaulniers, Dynamic aggregation of setpartitioning constraints in column generation, Operations Research 53 (2005) 632\u2013645.","journal-title":"Operations Research"},{"key":"13_CR32","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1287\/opre.35.6.832","volume":"35","author":"G.D. Eppen","year":"1987","unstructured":"G.D. Eppen and R.K. Martin, Solving multi-item capacitated lot-sizing problems using variable definition, Operations Research 35 (1987) 832\u2013848.","journal-title":"Operations Research"},{"key":"13_CR33","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1287\/opre.26.6.992","volume":"26","author":"D. Erlenkotter","year":"1978","unstructured":"D. Erlenkotter, A dual-based procedure for uncapacitated facility location, Operations Research 26 (1978) 992\u20131009.","journal-title":"Operations Research"},{"key":"13_CR34","first-page":"1","volume":"2","author":"Y.M. Ermol\u1ebbv","year":"1966","unstructured":"Y.M. Ermol\u1ebbv, Methods of solution of nonlinear extremal problems, Kibernetica 2 (1966) 1\u201317.","journal-title":"Kibernetica"},{"key":"13_CR35","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1287\/opre.11.3.399","volume":"11","author":"H. Everett III","year":"1963","unstructured":"H. Everett III, Generalized lagrange multiplier method for solving problems of optimal allocation of resources, Operations Research 11 (1963) 399\u2013417.","journal-title":"Operations Research"},{"key":"13_CR36","first-page":"457","volume":"12","author":"Gy. Farkas","year":"1894","unstructured":"Gy. Farkas, On the applications of the mechanical principle of Fourier, Mathematikai \u00e9s Term\u00e9szettudom\u00e1nyi \u00c9rtesot\u00f6 12 (1894) 457\u2013472.","journal-title":"Mathematikai \u00e9s Term\u00e9szettudom\u00e1nyi \u00c9rtesot\u00f6"},{"key":"13_CR37","unstructured":"M. Fischetti, D. Salvagnin, and A. Zanette, Minimal infeasible subsystems and Benders\u2019 cuts, Mathematical Programming to appear (2009)."},{"key":"13_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"M.L. Fisher","year":"1981","unstructured":"M.L. Fisher, The lagrangean relaxation method for solving integer programming problems, Management Science 27 (1981) 1\u201318.","journal-title":"Management Science"},{"key":"13_CR39","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1287\/mnsc.5.1.97","volume":"5","author":"L.R. Ford Jr","year":"1958","unstructured":"L.R. Ford, Jr. and D.R. Fulkerson, A suggested computation for maximal multi-commodity network flows, Management Science 5 (1958) 97\u2013101.","journal-title":"Management Science"},{"key":"13_CR40","unstructured":"J.B.J. Fourier, Solution d\u2019une question particuli\u00e8re du calcul des in\u00e9galit\u00e9s, Nouveau Bulletin des Sciences par la Soci\u00e9t\u00e9 Philomatique de Paris (1826) 317\u2013319."},{"key":"13_CR41","first-page":"38","volume":"10","author":"J.B.J. Fourier","year":"1973","unstructured":"J.B.J. Fourier, from 1824, republished as Second extrait in oeuvres de fourier, tome ii (G. Darboux, ed.), Gauthier-Villars, Paris, 1890, see D.A. Kohler, Translation of a report by Fourier on his work on linear inequalities, Opsearch 10 (1973) 38\u201342.","journal-title":"Opsearch"},{"key":"13_CR42","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10107-005-0644-x","volume":"106","author":"R. Fukosawa","year":"2006","unstructured":"R. Fukosawa, H. Longo, J. Lysgaard, M. Reis, E. Uchoa, and R.F. Werneck, Robust branchand-cut-and-price for the capacitated vehicle routing problem, Mathematical Programming 106 (2006) 491\u2013511.","journal-title":"Mathematical Programming"},{"key":"13_CR43","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1287\/mnsc.16.11.652","volume":"16","author":"A.M. Geoffrion","year":"1970","unstructured":"A.M. Geoffrion, Elements of large scale mathematical programming I and II, Management Science 16 (1970) 652\u2013691.","journal-title":"Management Science"},{"key":"13_CR44","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"A.M. Geoffrion","year":"1972","unstructured":"A.M. Geoffrion, Generalized Benders\u2019 decomposition, Journal of Optimization Theory and Applications 10 (1972) 237\u2013260.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"13_CR45","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"A.M. Geoffrion","year":"1974","unstructured":"A.M. Geoffrion, Lagrangean relaxation for integer programming, Mathematical Programming Study 2 (1974) 82\u2013114.","journal-title":"Mathematical Programming Study"},{"key":"13_CR46","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1287\/mnsc.20.5.822","volume":"20","author":"A.M. Geoffrion","year":"1974","unstructured":"A.M. Geoffrion and G.W. Graves, Multicommodity distribution design by Benders\u2019 decomposition, Management Science 20 (1974) 822\u2013844.","journal-title":"Management Science"},{"key":"13_CR47","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0024-3795(79)90018-1","volume":"25","author":"R. Giles","year":"1979","unstructured":"R. Giles and W.R. Pulleyblank, Total dual integrality and integral polyhedra, Linear algebra and its applications 25 (1979) 191\u2013196.","journal-title":"Linear algebra and its applications"},{"key":"13_CR48","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"P.C. Gilmore","year":"1961","unstructured":"P.C. Gilmore and R.E. Gomory, A linear programming approach to the cutting stock problem, Operations Research 9 (1961) 849\u2013859.","journal-title":"Operations Research"},{"key":"13_CR49","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1287\/opre.11.6.863","volume":"11","author":"P.C. Gilmore","year":"1963","unstructured":"P.C. Gilmore and R.E. Gomory, A linear programming approach to the cutting stock problem: Part ii, Operations Research 11 (1963) 863\u2013888.","journal-title":"Operations Research"},{"key":"13_CR50","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1080\/1055678021000060829a","volume":"17","author":"J.-L. Goffin","year":"2002","unstructured":"J.-L. Goffin and J.-P. Vial, Convex non-differentiable optimization: a survey focused on the analytic center cutting plane method, Optimization Methods and Software 17 (2002) 805\u2013867.","journal-title":"Optimization Methods and Software"},{"key":"13_CR51","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1287\/opre.43.1.130","volume":"43","author":"L. Gouveia","year":"1995","unstructured":"L. Gouveia, A 2n constraint formulation for the capacitated minimal spanning tree problem, Operations Research 43 (1995) 130\u2013141.","journal-title":"Operations Research"},{"key":"13_CR52","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz, and A. Schrijver, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica 1 (1981) 169\u2013197.","journal-title":"Combinatorica"},{"key":"13_CR53","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1051\/ro\/1987210403071","volume":"21","author":"M. Guignard","year":"1987","unstructured":"M. Guignard and S. Kim, Lagrangean decomposition for integer programming: Theory and applications, RAIRO 21 (1987) 307\u2013323.","journal-title":"RAIRO"},{"key":"13_CR54","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M. Held","year":"1970","unstructured":"M. Held and R.M. Karp, The traveling salesman problem and minimum spanning trees, Operations Research 18 (1970) 1138\u20131162.","journal-title":"Operations Research"},{"key":"13_CR55","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M. Held","year":"1971","unstructured":"M. Held and R.M. Karp, The traveling salesman problem and minimum spanning trees: Part II, Mathematical Programming 1 (1971) 6\u201325.","journal-title":"Mathematical Programming"},{"key":"13_CR56","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/BF01580223","volume":"6","author":"M. Held","year":"1974","unstructured":"M. Held, P. Wolfe, and H.P. Crowder, Validation of subgradient optimization, Mathematical Programming 6 (1974) 62\u201388.","journal-title":"Mathematical Programming"},{"key":"13_CR57","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1287\/ijoc.13.4.258.9733","volume":"13","author":"V. Jain","year":"2001","unstructured":"V. Jain and I.E. Grossman, Algorithms for hybrid milp\/clp models for a class of optimization problems, INFORMS J. Computing 13 (2001) 258\u2013276.","journal-title":"INFORMS J. Computing"},{"key":"13_CR58","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.orl.2003.06.001","volume":"32","author":"R. Jans","year":"2004","unstructured":"R. Jans and Z. Degraeve, Improved lower bounds for the capacitated lot sizing problem with set-up times, Operations Research Letters 32 (2004) 185\u2013195.","journal-title":"Operations Research Letters"},{"key":"13_CR59","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0377-2217(86)90328-0","volume":"27","author":"K. Jornsten","year":"1986","unstructured":"K. Jornsten and M. Nasberg, A new Lagrangian relaxation approach to the generalized assignment problem, European Journal of Operational Research 27 (1986) 313\u2013323.","journal-title":"European Journal of Operational Research"},{"key":"13_CR60","first-page":"703","volume":"8","author":"J.E. Kelley","year":"1960","unstructured":"J.E. Kelley, The cutting plane method for solving convex programs, SIAM Journal 8 (1960) 703\u2013712.","journal-title":"SIAM Journal"},{"key":"13_CR61","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/BF02591907","volume":"27","author":"K.C. Kiwiel","year":"1983","unstructured":"K.C. Kiwiel, An aggregate subgradient method for nonsmooth convex minimization, Mathematical Programming 27 (1983) 320\u2013341.","journal-title":"Mathematical Programming"},{"key":"13_CR62","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0167-6377(93)90002-X","volume":"13","author":"G. Laporte","year":"1993","unstructured":"G. Laporte and F.V. Louveaux, The integer L-shaped method for stochastic integer programs with complete recourse, Operations Research Letters 13 (1993) 133\u2013142.","journal-title":"Operations Research Letters"},{"key":"13_CR63","unstructured":"C. Lemar\u00e9chal, An algorithm for minimizing convex functions, Information Processing \u201974 (J.L. Rosenfeld, ed.), North Holland, 1974, pp. 552\u2013556."},{"key":"13_CR64","unstructured":"C. Lemar\u00e9chal, Nonsmooth optimization and descent methods, Tech. report, IIASA, 1978."},{"key":"13_CR65","doi-asserted-by":"crossref","unstructured":"C. Lemar\u00e9chal, Lagrangean relaxation, Computational Combinatorial Optimization (M. J\u00fcnger and D. Naddef, eds.), Lecture Notes in Computer Science 2241, Springer, 2001, pp. 112\u2013156.","DOI":"10.1007\/3-540-45586-8_4"},{"key":"13_CR66","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"A.K. Lenstra, H.W. Lenstra, Jr., and L. Lov\u00e1sz, Factoring polynomials with rational coefficients, Mathematische Annalen 261 (1982) 515\u2013534.","journal-title":"Mathematische Annalen"},{"key":"13_CR67","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra Jr","year":"1983","unstructured":"H.W. Lenstra, Jr., Integer programming with a fixed number of variables, Mathematics of Operations Research 8 (1983) 538\u2013547.","journal-title":"Mathematics of Operations Research"},{"key":"13_CR68","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1287\/opre.29.3.464","volume":"29","author":"T.L. Magnanti","year":"1981","unstructured":"T.L. Magnanti and R.T. Wong, Accelerated Benders\u2019 decomposition: Algorithmic enhancement and model selection criteria, Operations Research 29 (1981) 464\u2013484.","journal-title":"Operations Research"},{"key":"13_CR69","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1287\/opre.35.6.820","volume":"35","author":"R.K. Martin","year":"1987","unstructured":"R.K. Martin, Generating alternative mixed integer programming models using variable definition, Operations Research 35 (1987) 820\u2013831.","journal-title":"Operations Research"},{"key":"13_CR70","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0167-6377(91)90028-N","volume":"10","author":"R.K. Martin","year":"1991","unstructured":"R.K. Martin, Using separation algorithms to generate mixed integer model reformulations, Operations Research Letters 10 (1991) 119\u2013128.","journal-title":"Operations Research Letters"},{"key":"13_CR71","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1287\/opre.38.1.127","volume":"38","author":"R.K. Martin","year":"1990","unstructured":"R.K. Martin, R.L. Rardin, and B.A. Campbell, Polyhedral characterization of discrete dynamic programming, Operations Research 38 (1990) 127\u2013138.","journal-title":"Operations Research"},{"key":"13_CR72","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF01585518","volume":"7","author":"R.R. Meyer","year":"1974","unstructured":"R.R. Meyer, On the existence of optimal solutions to integer and mixed integer programming problems, Mathematical Programming 7 (1974) 223\u2013235.","journal-title":"Mathematical Programming"},{"key":"13_CR73","volume-title":"Geometrie der Zahlen (erste Lieferung)","author":"H. Minkowski","year":"1986","unstructured":"H. Minkowski, Geometrie der Zahlen (erste Lieferung), Teubner, Leipzig, 1986."},{"key":"13_CR74","unstructured":"P.J. Neame, Nonsmooth dual methods in integer programing, Ph.D. thesis, Depart. of Math. and Statistics, The University of Melbourne, 1999."},{"key":"13_CR75","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/BF01588301","volume":"18","author":"M.W. Padberg","year":"1980","unstructured":"M.W. Padberg, (1, k)-configurations and facets for packing problems, Mathematical Programming 18 (1980) 94\u201399.","journal-title":"Mathematical Programming"},{"key":"13_CR76","unstructured":"A. Pessoa, E. Uchoa, M. Poggi de Aragao, and R. Rodrigues, Algorithms over arc-time indexed formulations for single and parallel machine scheduling problems, Tech. report, Rio de Janeiro, 2009."},{"key":"13_CR77","volume-title":"Production planning by mixed-integer programming, Springer Series in Operations Research and Financial Engineering","author":"Y. Pochet","year":"2006","unstructured":"Y. Pochet and L.A. Wolsey, Production planning by mixed-integer programming, Springer Series in Operations Research and Financial Engineering, Springer, New York, 2006."},{"key":"13_CR78","first-page":"593","volume":"8","author":"B.T. Polyak","year":"1967","unstructured":"B.T. Polyak, A general method for solving extremum problems, Soviet Mathematic Doklady 8 (1967) 593\u2013597.","journal-title":"Soviet Mathematic Doklady"},{"key":"13_CR79","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1287\/mnsc.16.1.93","volume":"16","author":"A.A.B. Pritsker","year":"1969","unstructured":"A.A.B. Pritsker, L.J. Watters, and P.J. Wolfe, Multiproject scheduling with limited resources: a zero-one programming approach, Management Science 16 (1969) 93\u2013108.","journal-title":"Management Science"},{"key":"13_CR80","unstructured":"A. Prodon, T.M. Liebling, and H. Gr\u00f6flin, Steiner\u2019s problem on 2-trees, Tech. Report RO 850351, D\u00e9partement de Math\u00e9matiques, Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne, 1985."},{"key":"13_CR81","unstructured":"R.L. Rardin and U. Choe, Tighter relaxations of fixed charge network flow problems, Tech. Report report J-79-18, School of Industrial and Systems Engineering, Georgia Institute of Technology, 1979."},{"key":"13_CR82","unstructured":"L.-M. Rousseau, M. Gendreau, and D. Feillet, Interior point stabilization for column generation, Tech. report, University de Montreal, 2003."},{"key":"13_CR83","unstructured":"D.M. Ryan and B.A. Foster, An integer programming approach to scheduling, Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling (A. Wren, ed.), North-Holland, Amsterdam, 1981, pp. 269\u2013280."},{"key":"13_CR84","unstructured":"F. Soumis, Decomposition and column generation, Annotated Bibliographies in Combinatorial Optimization (F. Maffioli M. Dell\u2019Amico and S. Martello, eds.), Wiley, Chichester, 1997, pp. 115\u2013126."},{"key":"13_CR85","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10107-006-0043-y","volume":"112","author":"E. Uchoa","year":"2008","unstructured":"E. Uchoa, R. Fukasawa, J. Lysgaard, A. Pessoa, M.P. Aragao, and D. Andrade, Robust branchand- cut-and-price for the capacitated minimum spanning tree problem over an extended formulation, Mathematical Programming 112 (2008) 443\u2013472.","journal-title":"Mathematical Programming"},{"key":"13_CR86","unstructured":"H. Uzawa, Iterative methods for concave programming, Studies in Linear and Nonlinear Programming (K. Arrow, L. Hurwicz, and H. Uzawa, eds.), Stanford University Press, 1959."},{"key":"13_CR87","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1137\/0117061","volume":"17","author":"R.M. Slyke Van","year":"1969","unstructured":"R.M. Van Slyke and R. Wets, L-shaped linear programs with applications to optimal control and stochastic programming, SIAM J. of Applied Mathematics 17 (1969) 638\u2013663.","journal-title":"SIAM J. of Applied Mathematics"},{"key":"13_CR88","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10107-004-0521-z","volume":"108","author":"M. Vyve Van","year":"2006","unstructured":"M. Van Vyve, Linear programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity, Mathematical Programming 108 (2006) 53\u201378.","journal-title":"Mathematical Programming"},{"key":"13_CR89","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1287\/opre.48.1.111.12453","volume":"48","author":"F. Vanderbeck","year":"2000","unstructured":"F. Vanderbeck, On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm, Operations Research 48 (2000) 111\u2013128.","journal-title":"Operations Research"},{"key":"13_CR90","unstructured":"F. Vanderbeck, Branching in branch-and-price: a generic scheme, Research Report Inria-00311274, University Bordeaux I and INRIA, 2006, revised 2008."},{"key":"13_CR91","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0167-6377(96)00033-8","volume":"19","author":"F. Vanderbeck","year":"1996","unstructured":"F. Vanderbeck and L.A. Wolsey, An exact algorithm for IP column generation, Operations Research Letters 19 (1996) 151\u2013159.","journal-title":"Operations Research Letters"},{"key":"13_CR92","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10479-005-3455-9","volume":"139","author":"D. Villeneuve","year":"2006","unstructured":"D. Villeneuve, J. Desrosiers, M.E. L\u00fcbbecke, and F. Soumis, On compact formulations for integer programs solved by column generation, Annals of Operations Research 139 (2006) 375\u2013388.","journal-title":"Annals of Operations Research"},{"key":"13_CR93","unstructured":"S.Weider, Integration of vehicle and duty scheduling in public transport, Ph.D. thesis, Faculty of Mathematics and Sciences, The Technical University, Berlin, 2007."},{"key":"13_CR94","first-page":"151","volume":"4","author":"P. Wentges","year":"1997","unstructured":"P.Wentges, Weighted dantzig-wolfe decomposition for linear mixed-integer programming, International Transactions on Operational Research 4 (1997) 151\u2013162.","journal-title":"International Transactions on Operational Research"},{"key":"13_CR95","doi-asserted-by":"crossref","unstructured":"H. Weyl, The elementary theory of convex polyhedra, Contributions to the Theory of Games I (H.W. Kuhn and A.W. Tucker, eds.), Princeton University Press, Princton N.J, translated from 1935 original in German, 1950, pp. 3\u201318.","DOI":"10.1515\/9781400881727-002"},{"key":"13_CR96","unstructured":"R.T. Wong, Integer programming formulations of the traveling salesman problem, Proceedings of IEEE International Conference on Circuits and Computers, 1980, pp. 149\u2013152."},{"key":"13_CR97","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF02612335","volume":"28","author":"R.T. Wong","year":"1984","unstructured":"R.T.Wong, Dual ascent approach for Steiner tree problems on directed graphs, Mathematical Programming 28 (1984) 271\u2013287.","journal-title":"Mathematical Programming"},{"key":"13_CR98","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/0022-0000(91)90024-Y","volume":"43","author":"M. Yannakakis","year":"1991","unstructured":"M. Yannakakis, Expressing combinatorial optimization problems by linear programs, Journal of Computer and System Sciences 43 (1991) 441\u2013466.","journal-title":"Journal of Computer and System Sciences"}],"container-title":["50 Years of Integer Programming 1958-2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68279-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,6]],"date-time":"2020-03-06T22:03:18Z","timestamp":1583532198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68279-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,6]]},"ISBN":["9783540682745","9783540682790"],"references-count":98,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68279-0_13","relation":{},"subject":[],"published":{"date-parts":[[2009,11,6]]},"assertion":[{"value":"6 November 2009","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}