{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:24:28Z","timestamp":1761895468171},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642308499"},{"type":"electronic","value":"9783642308505"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30850-5_29","type":"book-chapter","created":{"date-parts":[[2012,5,27]],"date-time":"2012-05-27T21:44:33Z","timestamp":1338155073000},"page":"332-343","source":"Crossref","is-referenced-by-count":4,"title":["Feasibility Pump Heuristics for Column Generation Approaches"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Pesneau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruslan","family":"Sadykov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois","family":"Vanderbeck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"29_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.disopt.2006.10.004","volume":"4","author":"T. Achterberg","year":"2007","unstructured":"Achterberg, T., Berthold, T.: Improving the feasibility pump. Discrete Optim.\u00a04(1), 77\u201386 (2007)","journal-title":"Discrete Optim."},{"issue":"7","key":"29_CR2","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1002\/net.3230190702","volume":"19","author":"Y. Agarwal","year":"1989","unstructured":"Agarwal, Y., Mathur, K., Salkin, H.M.: A set-partitioning-based exact algorithm for the vehicle routing problem. Networks\u00a019(7), 731\u2013749 (1989)","journal-title":"Networks"},{"issue":"2","key":"29_CR3","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/S0377-2217(02)00125-X","volume":"141","author":"G. Belov","year":"2002","unstructured":"Belov, G., Scheithauer, G.: A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths. European J. Oper. Res.\u00a0141(2), 274\u2013294 (2002)","journal-title":"European J. Oper. Res."},{"issue":"1","key":"29_CR4","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.disopt.2006.10.001","volume":"4","author":"L. Bertacco","year":"2007","unstructured":"Bertacco, L., Fischetti, M., Lodi, A.: A feasibility pump heuristic for general mixed-integer problems. Discrete Optimization\u00a04(1), 63\u201376 (2007)","journal-title":"Discrete Optimization"},{"key":"29_CR5","unstructured":"Berthold, T.: Primal Heuristics for Mixed Integer Programs. Master\u2019s thesis, Technische Universit\u00e4t Berlin (2006)"},{"key":"29_CR6","unstructured":"Bixby, B.: Presentation of the gurobi optimizer. In: Integer Programming Down Under: Theory, Algorithms and Applications, Workshop at Newcastle NSW (2011)"},{"key":"29_CR7","unstructured":"Ceselli, A., Righini, G., Salani, M.: A column generation algorithm for a vehicle routing problem with economies of scale and additional constraints. In: Proceedings TRISTAN, Phuket, Thailand (June 2007)"},{"key":"29_CR8","unstructured":"Chabrier, A.: Heuristic branch-and-price-and-cut to solve a network design problem. In: Proceedings CPAIOR, Montreal, Canada (May 2003)"},{"key":"29_CR9","unstructured":"Chabrier, A., Danna, E., Le Pape, C.: Coop\u00e9ration entre g\u00e9n\u00e9ration de colonnes et recherche locale appliqu\u00e9es au probl\u00e8me de routage de v\u00e9hicules. In: Huiti\u00e8mes Journ\u00e9es Nationales sur la r\u00e9solution de Probl\u00e8mes NP-Complets (JNPC), Nice, France, pp. 83\u201397 (May 2002)"},{"issue":"4","key":"29_CR10","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1287\/moor.7.4.515","volume":"7","author":"G. Dobson","year":"1982","unstructured":"Dobson, G.: Worst-case analysis of greedy heuristics for integer programming with nonnegative data. Math. Oper. Res.\u00a07(4), 515\u2013531 (1982)","journal-title":"Math. Oper. Res."},{"issue":"1, ser. A","key":"29_CR11","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-004-0570-3","volume":"104","author":"M. Fischetti","year":"2005","unstructured":"Fischetti, M., Glover, F., Lodi, A.: The feasibility pump. Math. Program.\u00a0104(1, ser. A), 91\u2013104 (2005)","journal-title":"Math. Program."},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Fischetti, M., Lodi, A.: Heuristics in Mixed Integer Programming. Wiley Encyclopedia of Operations Research and Management Science, J.J. Cochran Edt., vol.\u00a03, pp. 2199\u20132204. Wiley (2011)","DOI":"10.1002\/9780470400531.eorms0376"},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s12532-009-0007-3","volume":"1","author":"M. Fischetti","year":"2009","unstructured":"Fischetti, M., Salvagnin, D.: Feasibility pump 2.0. Mathematical Programming Computation\u00a01, 201\u2013222 (2009)","journal-title":"Mathematical Programming Computation"},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1016\/j.endm.2010.05.088","volume":"36","author":"C. Joncour","year":"2010","unstructured":"Joncour, C., Michel, S., Sadykov, R., Sverdlov, D., Vanderbeck, F.: Column generation based primal heuristics. Electronic Notes in Discrete Mathematics\u00a036, 695\u2013702 (2010)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"29_CR15","unstructured":"Perrot, N.: Integer Programming Column Generation Strategies for the Cutting Stock Problem and its Variants. PhD thesis, Universit\u00e9 Bordeaux 1, France (2005)"},{"issue":"5","key":"29_CR16","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1287\/opre.45.5.758","volume":"45","author":"D. Pisinger","year":"1997","unstructured":"Pisinger, D.: A minimal algorithm for the 0-1 knapsack problem. Operations Research\u00a045(5), 758\u2013767 (1997)","journal-title":"Operations Research"},{"issue":"1","key":"29_CR17","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1287\/ijoc.12.1.75.11898","volume":"12","author":"D. Pisinger","year":"2000","unstructured":"Pisinger, D.: A minimal algorithm for the bounded knapsack problem. INFORMS Journal on Computing\u00a012(1), 75\u201382 (2000)","journal-title":"INFORMS Journal on Computing"},{"issue":"6","key":"29_CR18","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1287\/opre.45.6.831","volume":"45","author":"M. Savelsbergh","year":"1997","unstructured":"Savelsbergh, M.: A branch-and-price algorithm for the generalized assignment problem. Operations Research\u00a045(6), 831\u2013841 (1997)","journal-title":"Operations Research"},{"key":"29_CR19","unstructured":"Schmid, V., Doerner, K.F., Hartl, R.F., Savelsbergh, M.W.P., Stoecher, W.: An effective heuristic for ready mixed concrete delivery. In: Proceedings TRISTAN, Phuket, Thailand (June 2007)"},{"issue":"1","key":"29_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1051\/ro:1999101","volume":"33","author":"\u00c9.D. Taillard","year":"1999","unstructured":"Taillard, \u00c9.D.: A heuristic column generation method for the heterogeneous fleet VRP. RO Oper. Res.\u00a033(1), 1\u201314 (1999)","journal-title":"RO Oper. Res."},{"key":"29_CR21","unstructured":"Vanderbeck, F.: Bapcod - a generic branch-and-price code (2008), \n                    \n                      http:\/\/wiki.bordeaux.inria.fr\/realopt\/"},{"issue":"3","key":"29_CR22","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.W.P.: A generic view of dantzig-wolfe decomposition in mixed integer programming. Operations Research Letters\u00a034(3), 296\u2013306 (2006)","journal-title":"Operations Research Letters"},{"key":"29_CR23","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-540-68279-0_13","volume-title":"50 Years of Integer Programming 1958-2008","author":"F. Vanderbeck","year":"2010","unstructured":"Vanderbeck, F., Wolsey, L.: Reformulation and decomposition of integer programs. In: 50 Years of Integer Programming 1958-2008, pp. 431\u2013502. Springer, Berlin Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30850-5_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:02:45Z","timestamp":1558299765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30850-5_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642308499","9783642308505"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30850-5_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}