{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T21:49:19Z","timestamp":1654811359158},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,10,1]],"date-time":"2005-10-01T00:00:00Z","timestamp":1128124800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2005,10]]},"DOI":"10.1007\/s10479-005-3450-1","type":"journal-article","created":{"date-parts":[[2005,9,15]],"date-time":"2005-09-15T22:31:07Z","timestamp":1126823467000},"page":"243-265","source":"Crossref","is-referenced-by-count":1,"title":["Rapid Prototyping of Optimization Algorithms Using COIN-OR: A Case Study Involving the Cutting-Stock Problem"],"prefix":"10.1007","volume":"139","author":[{"given":"Laszlo","family":"Ladanyi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jon","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robin","family":"Lougee-Heimer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3450_CR1","unstructured":"CONCORDE. http:\/\/www.math.princeton.edu\/tsp\/concorde.html."},{"key":"3450_CR2","unstructured":"Concurrent Versions System. http:\/\/www.cvshome.org."},{"key":"3450_CR3","unstructured":"MIPLIB 3.0. http:\/\/www.caam.rice.edu\/~bixby\/miplib\/miplib3.html."},{"key":"3450_CR4","unstructured":"MPL. http:\/\/www.maximal-usa.com."},{"key":"3450_CR5","unstructured":"Netcraft. http:\/\/www.netcraft.com, July 2001."},{"key":"3450_CR6","unstructured":"Open Souce Initiative. http:\/\/opensource.org."},{"key":"3450_CR7","unstructured":"Problems at DCI. http:\/\/www.research.ibm.com\/dci\/problems.shtml."},{"key":"3450_CR8","first-page":"26","volume":"26","author":"R. Anbil","year":"1999","unstructured":"Anbil, R., F. Barahona, L. Ladanyi, R. Rushmeier, and J. Snowdon. (1999). \u201cIbm Makes Advances in Airline Optimization.\u201d OR\/MS Today 26, 26\u201329.","journal-title":"OR\/MS Today"},{"key":"3450_CR9","unstructured":"Bahiense, L., F. Barahona, and O. Porto. (2000). \u201cSolving Steiner Tree Problems in Graphs with Lagrangian Relaxation.\u201d IBM Research Report RC21847."},{"issue":"3, Ser. A","key":"3450_CR10","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"Balas, E., S. Ceria, and G. Cornu\u00e9jols. (1993). \u201cA Lift-and-Project Cutting Plane Algorithm for Mixed 0-1 Programs.\u201d Math. Programming 58(3, Ser. A), 295\u2013324.","journal-title":"Math. Programming"},{"key":"3450_CR11","unstructured":"Balas, E., S. Ceria, and G. Cornu\u00e9jols. (1993). \u201cSolving Mixed 0-1 Programs by a Lift-and-Project Method.\u201d In Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Austin, TX, 1993), New York, ACM, pp. 232\u2013242."},{"key":"3450_CR12","unstructured":"Barahona, F. and R. Anbil. (1999). \u201cSolving Large Scale Uncapacitated Facility Location Problems.\u201d IBM Research Report RC21515."},{"key":"3450_CR13","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"F. Barahona","year":"2000","unstructured":"Barahona, F. and R. Anbil. (2000). \u201cThe Volume Algorithm: Producing Primal Solution with a Subgradient Algorithm.\u201d Math. Program 87, 385\u2013399.","journal-title":"Math. Program"},{"key":"3450_CR14","doi-asserted-by":"crossref","unstructured":"Barahona, F. and R. Anbil. (2002). \u201cOn Some Difficult Linear Programs Coming from Set Partitioning.\u201d Discrete Appl. Math 118(1\u20132), 3\u201311; Third ALIO-EURO Meeting on Applied Combinatorial Optimization (Erice, 1999).","DOI":"10.1016\/S0166-218X(01)00252-9"},{"key":"3450_CR15","unstructured":"Barahona, F. and F. Chudak. (1999). \u201cNear-Optimal Solutions to Large Scale Facility Location Problems.\u201d IBM Research Report RC21606."},{"key":"3450_CR16","unstructured":"Barahona, F. and L. Ladanyi. (2001). \u201cBranch and Cut Based on the Volume Algorithm: Steiner Trees in Graphs and Max-Cut.\u201d IBM Research Report RC2222."},{"key":"3450_CR17","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-0-387-35514-6_2","volume-title":"System modelling and optimization (Cambridge, 1999)","author":"R.E. Bixby","year":"2000","unstructured":"Bixby, R.E., M. Fenelon, Z. Gu, E. Rothberg, and R. Wunderling. (2000). \u201cMIP: Theory and Practice\u2014Closing the Gap.\u201d In System modelling and optimization (Cambridge, 1999), Kluwer Acad. Publ., Boston, MA, pp. 19\u201349."},{"issue":"1","key":"3450_CR18","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 M. Peeters. (2003). \u201cOptimal Integer Solutions to Industrial Cutting-Stock Problems. II. Benchmark Results.\u201d INFORMS J. Comput 15(1), 58\u201381.","journal-title":"INFORMS J. Comput"},{"issue":"14","key":"3450_CR19","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1287\/ijoc.11.4.406","volume":"11","author":"Degraeve","year":"1999","unstructured":"Degraeve and L. Schrage. (1999). \u201cOptimal Integer Solutions to Industrial Cutting Stock Problems.\u201d INFORMS J. Comput. 11(14), 406\u2013419.","journal-title":"INFORMS J. Comput."},{"key":"3450_CR20","unstructured":"Eso, M., S. Gosh, L. Ladanyi, and J. Kalagnanam. (2001). \u201cBid Evaluation in Procurement Auctions with Piece-Wise Linear Supply Curves.\u201d IBM Research Report RC22219."},{"key":"3450_CR21","unstructured":"Eso, M., D.L. Jensen, and L. Ladanyi. (2002). \u201cSolving Lexicographic Multiobjective MIP with Column Generation.\u201d INFORMS Annual Meeting, San Jose; abstract, pp. 88."},{"key":"3450_CR22","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1287\/opre.38.5.922","volume":"38","author":"A. Farley","year":"1990","unstructured":"Farley, A. (1990). \u201cA Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems.\u201d Operations Research 38, 922\u2013923.","journal-title":"Operations Research"},{"issue":"1","key":"3450_CR23","first-page":"183","volume":"31","author":"J. Forrest","year":"1987","unstructured":"Forrest, J. and J. Tomlin. (1987). \u201cImplementing Interior Point Linear Programming Methods in the Optimization Subroutine Library.\u201d IBM System Journal 31(1), 183\u2013209.","journal-title":"IBM System Journal"},{"key":"3450_CR24","unstructured":"Fortz, B., A.R. Mahjoub, S.T. McCormick, and P. Pesneau. (2002). \u201cThe 2-edge Connected Subgraph Problem With Bounded Rings.\u201d Preprint."},{"key":"3450_CR25","unstructured":"Galati, M. (2002). \u201cGalexis Distribution Problem.\u201d \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne RO2002.0508."},{"key":"3450_CR26","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 G. W\u00e4scher. (1995). \u201cCutgen1: A Problem Generator for the Standard One-Dimensional Cutting Stock Problem.\u201d Eur. Jour. of Oper. Res. 84, 572\u2013579.","journal-title":"Eur. Jour. of Oper. Res."},{"key":"3450_CR27","unstructured":"Geoffrion, A. The shared destiny initiative, see http:\/\/www.anderson.ucla.edu\/informs\/sdi.htm."},{"key":"3450_CR28","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"P.C. Gilmore","year":"1961","unstructured":"Gilmore, P.C. and R.E. Gomory. (1961). \u201cA Linear Programming Approach to the Cutting-Stock Problem. Oper. Res. 9, 849\u2013859.","journal-title":"Oper. Res."},{"issue":"1","key":"3450_CR29","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/opre.29.1.49","volume":"29","author":"M. Guignard","year":"1981","unstructured":"Guignard, M. and K. Spielberg. (1981). \u201cLogical Reduction Method in Zero-One Programming (Minimal Preferred Variables).\u201d Oper. Res. 29(1), 49\u201374.","journal-title":"Oper. Res."},{"key":"3450_CR30","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/PL00011430","volume":"90","author":"O. G\u00fcnl\u00fck","year":"2001","unstructured":"G\u00fcnl\u00fck O. and Y. Pochet. (2001). \u201cMixing Mixed-Integer Inequalities. Math. Programming 90, 429\u2013457.","journal-title":"Math. Programming"},{"issue":"4","key":"3450_CR31","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1287\/opre.48.4.505.12425","volume":"48","author":"J. Kalagnanam","year":"2000","unstructured":"Kalagnanam, J., M. Dawande, M. Trumbo, and H.S. Lee. (2000). \u201cThe Surplus Inventory Matching Problem in the Process Industry.\u201d Operations Research 48(4), 505\u2013516.","journal-title":"Operations Research"},{"key":"3450_CR32","unstructured":"Ladanyi, L., J. Forrest, and J. Kalagnanam. (2001). \u201cColumn Generation Approach to the Multiple Knapsack Problem with Color Constraints.\u201d IBM Research Report RC22013."},{"key":"3450_CR33","unstructured":"Lee, J. (2002). \u201cService-parts Logistics.\u201d Tutorial on Supply Chain and Logistics Optimization, Institute for Mathematics and its Applications, University of Minnesota."},{"key":"3450_CR34","unstructured":"Lee, J. (2000). Cropped Cubes. IBM Research Report RC21830 In: Journal of Combinatorial Optimization (To appear)."},{"key":"3450_CR35","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1287\/opre.15.5.892","volume":"15","author":"C.E. Lemke","year":"1967","unstructured":"Lemke, C.E. and K. Spielberg. (1967). \u201cDirect Search Algorithms for Zero-One and Mixed-Integer Programming.\u201d Oper. Res 15, 892\u2013914.","journal-title":"Oper. Res"},{"key":"3450_CR36","unstructured":"Lougee-Heimer, R. (2001). \u201cThe Coin-or Initiative: Open Source Software for Optimization.\u201d In Proceedings Third International Workshop on Integration of AI and Or Techniques in Constraint Programming for Combinatorial Optimization Problems, pp. 307\u2013319."},{"key":"3450_CR37","doi-asserted-by":"crossref","unstructured":"Lougee-Heimer, R. (2002). \u201cThe Common Optimization Interface for Operations Research: Promoting Open-Source Software in the Operations Research Community.\u201d IBM Journal of Research and Development 47(1).","DOI":"10.1147\/rd.471.0057"},{"issue":"4","key":"3450_CR38","first-page":"20","volume":"28","author":"R. Lougee-Heimer","year":"2001","unstructured":"Lougee-Heimer, R., J.P. Fasano, F. Barahona, B. Dietrich, J. Forrest, R. Harder, L. Ladanyi, T. Pfender, T. Ralphs, M. Saltzman, and K. Scheinberg. (2001). \u201cThe Coin-or Initiative: Open Source Accelerates Operations Research Progress.\u201d ORMS Today 28(4), 20\u201322.","journal-title":"ORMS Today"},{"key":"3450_CR39","unstructured":"Lulli, G. and S. Sen. (2001). \u201cA Branch-and-Price Algorithm for Multi-Stage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problem.\u201d submitted for publication."},{"issue":"3","key":"3450_CR40","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/opre.49.3.363.11211","volume":"49","author":"H. Marchand","year":"2001","unstructured":"Marchand, H. and L.A. Wolsey. (2001). \u201cAggregation and Mixed Integer Rounding to Solve MIPs.\u201d Oper. Res. 49(3), 363\u2013371.","journal-title":"Oper. Res."},{"key":"3450_CR41","unstructured":"Martello, S. and P. Toth. (1990). Knapsack problems. Wiley-Interscience Series in Discrete Mathematics and Optimization.\u201d John Wiley & Sons Ltd., Chichester, Algorithms and computer implementations."},{"key":"3450_CR42","doi-asserted-by":"crossref","unstructured":"Mitchell, J.E. (1998). \u201cAn Interior Point Cutting Plane Algorithm for Ising Spin Glass Problems.\u201d In Operations Research Proceedings 1997 (Jena), Springer: Berlin, pp. 114\u2013119.","DOI":"10.1007\/978-3-642-58891-4_17"},{"key":"3450_CR43","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02592025","volume":"36","author":"W. Murray","year":"1986","unstructured":"Murray, W., P. Gill, M. Saunders, and J. Tomlin. (1986). \u201cOn Projected Newton Barrier Methods for Linear Programming and an Equivalence to Karmarkar's Projective Method.\u201d Mathematical Programming 36, 183\u2013209.","journal-title":"Mathematical Programming"},{"key":"3450_CR44","unstructured":"Nediak, M. and J. Eckstein. (2001). \u201cPivot, Cut, and Dive: A Heuristic for 0-1 Mixed Integer Programming.\u201d RUTCOR Research Report RRR 53-2001."},{"key":"3450_CR45","unstructured":"Nemhauser, G. and L. Wolsey. (1999). Integer and Combinatorial Optimization. John Wiley & Sons Inc., New York; Reprint of the 1988 original, A Wiley-Interscience Publication."},{"key":"3450_CR46","unstructured":"Pesneau, P., A.R. Mahjoub, and S.T. McCormick. (2002). \u201cThe 2-Edge Connected Subgraph Problem With Bounded Rings.\u201d IFORS."},{"key":"3450_CR47","doi-asserted-by":"crossref","unstructured":"Saltzman, M.J. (2002). \u201cCoin-or: An Open-Source Library for Optimization.\u201d In S. Nielsen, (ed.), Software for Compuational Economics and Finance Optimization. Kluwer.","DOI":"10.1007\/978-1-4615-1049-9_1"},{"issue":"2","key":"3450_CR48","first-page":"151","volume":"23","author":"G. Scheithauer","year":"1995","unstructured":"Scheithauer, G. and J. Terno. (1995). \u201cA Branch-and-Bound Algorithm for Solving One-Dimensional Cutting Stock Problems Exactly.\u201d Appl. Math. (Warsaw) 23(2), 151\u2013167.","journal-title":"Appl. Math. (Warsaw)"},{"key":"3450_CR49","doi-asserted-by":"crossref","unstructured":"Val\u00e9rio de Carvalho J.M. (1999). \u201cExact Solution of Bin-Packing Problems Using Column Generation and Branch-and-Bound.\u201d Ann. Oper. Res. 86, 629\u2013659; Advances in combinatorial optimization (London, 1996)","DOI":"10.1023\/A:1018952112615"},{"issue":"3","key":"3450_CR50","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1023\/A:1013733421344","volume":"21","author":"J.M. Val\u00e9rio de Carvalho","year":"2002","unstructured":"Val\u00e9rio de Carvalho J.M. (2002). \u201cA Note on Branch and Price Algorithms for the one Dimensional Cutting Stock Problem.\u201d Comput. Optim. Appl. 21(3), 339\u2013340.","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"3450_CR51","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1023\/A:1018346107246","volume":"9","author":"P.H. Vance","year":"1998","unstructured":"Vance, P.H. (1998). \u201cBranch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem.\u201d Comput. Optim. Appl. 9(3), 211\u2013228.","journal-title":"Comput. Optim. Appl."},{"issue":"3, Ser. A","key":"3450_CR52","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/s101070050105","volume":"86","author":"F. Vanderbeck","year":"1999","unstructured":"Vanderbeck, F. (1999). \u201cComputational Study of a Column Generation Algorithm for Bin Packing and Cutting Stock Problems.\u201d Math. Program. 86(3, Ser. A), 565\u2013594.","journal-title":"Math. Program."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-3450-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-005-3450-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-3450-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T14:27:43Z","timestamp":1586442463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-005-3450-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,10]]}},"alternative-id":["3450"],"URL":"https:\/\/doi.org\/10.1007\/s10479-005-3450-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10]]}}}