{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:33:06Z","timestamp":1764783186147},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131929"},{"type":"electronic","value":"9783642131936"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13193-6_21","type":"book-chapter","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T07:54:59Z","timestamp":1272354899000},"page":"239-252","source":"Crossref","is-referenced-by-count":40,"title":["Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs"],"prefix":"10.1007","author":[{"given":"Gerald","family":"Gamrath","sequence":"first","affiliation":[]},{"given":"Marco E.","family":"L\u00fcbbecke","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T. Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: Solving constraint integer programs. Math. Programming Computation\u00a01, 1\u201341 (2009)","journal-title":"Math. Programming Computation"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","volume":"33","author":"T. Achterberg","year":"2005","unstructured":"Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Operations Research Letters\u00a033, 42\u201354 (2005)","journal-title":"Operations Research Letters"},{"key":"21_CR3","unstructured":"Caprara, A., Furini, F., Malaguti, E.: Exact algorithms for the temporal knapsack problem. Technical report OR-10-7, DEIS, University of Bologna (2010)"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/net.20059","volume":"45","author":"A. Ceselli","year":"2005","unstructured":"Ceselli, A., Righini, G.: A branch-and-price algorithm for the capacitated p-median problem. Networks\u00a045, 125\u2013142 (2005)","journal-title":"Networks"},{"key":"21_CR5","unstructured":"Desaulniers, G., Desrosiers, J., Spoorendonk, S.: Cutting planes for branch-and-price algorithms, Les Cahiers du GERAD G-2009-52, HEC Montr\u00e9al (2009)"},{"key":"21_CR6","unstructured":"Gamrath, G.: Generic branch-cut-and-price. master\u2019s thesis, Institut f\u00fcr Mathematik, Technische Universit\u00e4t Berlin (2010)"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T","volume":"30","author":"M. J\u00fcnger","year":"2000","unstructured":"J\u00fcnger, M., Thienel, S.: The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization. Softw. Pract. Exper.\u00a030, 1325\u20131352 (2000)","journal-title":"Softw. Pract. Exper."},{"key":"21_CR8","unstructured":"Mittelmann, H.: Benchmarks for optimization software (2010), http:\/\/plato.asu.edu\/bench.html"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0167-6377(94)90013-2","volume":"15","author":"G. Nemhauser","year":"1994","unstructured":"Nemhauser, G., Savelsbergh, M., Sigismondi, G.: MINTO, a Mixed INTeger Optimizer. Oper. Res. Lett.\u00a015, 47\u201358 (1994)","journal-title":"Oper. Res. Lett."},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Puchinger, J., Stuckey, P., Wallace, M., Brand, S.: Dantzig-Wolfe decomposition and branch-and-price solving in G12. Constraints (to appear, 2010)","DOI":"10.1007\/s10601-009-9085-0"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10107-005-0606-3","volume":"106","author":"T. Ralphs","year":"2006","unstructured":"Ralphs, T., Galati, M.: Decomposition and dynamic cut generation in integer linear programming. Math. Programming\u00a0106, 261\u2013285 (2006)","journal-title":"Math. Programming"},{"key":"21_CR12","unstructured":"Ralphs, T., Galati, M.: DIP \u2013 decomposition for integer programming (2009), https:\/\/projects.coin-or.org\/Dip"},{"key":"21_CR13","unstructured":"Ralphs, T., Lad\u00e1nyi, L.: COIN\/BCP User\u2019s Manual (2001), http:\/\/www.coin-or.org\/Presentations\/bcp-man.pdf"},{"key":"21_CR14","first-page":"269","volume-title":"Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling","author":"D. Ryan","year":"1981","unstructured":"Ryan, D., Foster, B.A.: An integer programming approach to scheduling. In: Wren, A. (ed.) Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, pp. 269\u2013280. North Holland, Amsterdam (1981)"},{"key":"21_CR15","unstructured":"Scholl, A., Klein, R.: Bin packing instances: Data set 1, http:\/\/www.wiwi.uni-jena.de\/Entscheidung\/binpp\/"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1287\/opre.48.1.111.12453","volume":"48","author":"F. Vanderbeck","year":"2000","unstructured":"Vanderbeck, F.: On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm. Oper. Res.\u00a048, 111\u2013128 (2000)","journal-title":"Oper. Res."},{"key":"21_CR17","unstructured":"Vanderbeck, F.: BaPCod \u2013 a generic branch-and-price code (2005), https:\/\/wiki.bordeaux.inria.fr\/realopt\/pmwiki.php\/Project\/BaPCod"},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/0-387-25486-2_12","volume-title":"Column Generation","author":"F. Vanderbeck","year":"2005","unstructured":"Vanderbeck, F.: Implementing mixed integer column generation. In: Desaulniers, G., Desrosiers, J., Solomon, M. (eds.) Column Generation, pp. 331\u2013358. Springer, Heidelberg (2005)"},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.orl.2005.05.009","volume":"34","author":"F. Vanderbeck","year":"2006","unstructured":"Vanderbeck, F.: A generic view of Dantzig-Wolfe decomposition in mixed integer programming. Oper. Res. Lett.\u00a034, 296\u2013306 (2006)","journal-title":"Oper. Res. Lett."},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Vanderbeck, F.: Branching in branch-and-price: A generic scheme. Math. Programming (to appear, 2010)","DOI":"10.1007\/s10107-009-0334-1"},{"key":"21_CR21","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.orl.2005.05.009","volume":"34","author":"F. Vanderbeck","year":"2006","unstructured":"Vanderbeck, F., Savelsbergh, M.: A generic view of Dantzig-Wolfe decomposition in mixed integer programming. Oper. Res. Lett.\u00a034, 296\u2013306 (2006)","journal-title":"Oper. Res. Lett."},{"key":"21_CR22","volume-title":"50 Years of Integer Programming 1958\u20132008","author":"F. Vanderbeck","year":"2010","unstructured":"Vanderbeck, F., Wolsey, L.: Reformulation and decomposition of integer programs. In: J\u00fcnger, M., Liebling, T., Naddef, D., Nemhauser, G., Pulleyblank, W., Reinelt, G., Rinaldi, G., Wolsey, L. (eds.) 50 Years of Integer Programming 1958\u20132008. Springer, Berlin (2010)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13193-6_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:02:34Z","timestamp":1606168954000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13193-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131929","9783642131936"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13193-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}