{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T16:17:52Z","timestamp":1774973872381,"version":"3.50.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,5,9]],"date-time":"2012-05-09T00:00:00Z","timestamp":1336521600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1007\/s00186-012-0390-9","type":"journal-article","created":{"date-parts":[[2012,5,8]],"date-time":"2012-05-08T12:17:49Z","timestamp":1336479469000},"page":"67-93","source":"Crossref","is-referenced-by-count":36,"title":["Could we use a million cores to solve an integer program?"],"prefix":"10.1007","volume":"76","author":[{"given":"Thorsten","family":"Koch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ted","family":"Ralphs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuji","family":"Shinano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,5,9]]},"reference":[{"key":"390_CR1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/S0166-218X(01)00337-7","volume":"123","author":"K Aardal","year":"2002","unstructured":"Aardal K, Weismantel R, Wolsey LA (2002) Non-standard approaches to integer programming. Discret Appl Math 123: 5\u201374","journal-title":"Discret Appl Math"},{"issue":"1","key":"390_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg T (2009) SCIP: solving constraint integer programs. Math Program Comput 1(1): 1\u201341","journal-title":"Math Program Comput"},{"key":"390_CR3","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/978-3-642-01929-6_23","volume-title":"Integration of AI and OR techniques in constraint programming for combinatorial optimization problems, vol 5547 of lecture notes in computer science","author":"T Achterberg","year":"2009","unstructured":"Achterberg T, Berthold T (2009) Hybrid branching. In: Van Hoeve W-J, Hooker J (eds) Integration of AI and OR techniques in constraint programming for combinatorial optimization problems, vol 5547 of lecture notes in computer science. Springer, Heidelberg, pp 309\u2013311"},{"key":"390_CR4","doi-asserted-by":"crossref","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 (2005) Branching rules revisited. Oper Res Lett 33: 42\u201354","journal-title":"Oper Res Lett"},{"issue":"4","key":"390_CR5","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/j.orl.2005.07.009","volume":"34","author":"T Achterberg","year":"2006","unstructured":"Achterberg T, Koch T, Martin A (2006) MIPLIB 2003. Oper Res Lett 34(4): 361\u2013372","journal-title":"Oper Res Lett"},{"key":"390_CR6","doi-asserted-by":"crossref","DOI":"10.1515\/9781400841103","volume-title":"The traveling salesman problem: a computational study","author":"DL Applegate","year":"2007","unstructured":"Applegate DL, Bixby RE, Chvatal V, Cook WJ (2007) The traveling salesman problem: a computational study. Princeton University Press, Princeton"},{"key":"390_CR7","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"F Barahona","year":"2000","unstructured":"Barahona F, Anbil R (2000) The volume algorithm: producing primal solutions with a subgradient method. Math Program 87: 385\u2013399","journal-title":"Math Program"},{"key":"390_CR8","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10589-007-9048-6","volume":"38","author":"H Benson","year":"2007","unstructured":"Benson H, Shanno D (2007) An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming. Comput Optim Appl 38: 371\u2013399","journal-title":"Comput Optim Appl"},{"key":"390_CR9","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/978-3-642-00142-0_70","volume-title":"Operations research proceedings 2008","author":"T Berthold","year":"2009","unstructured":"Berthold T, Pfetsch ME (2009) Detecting orbitopal symmetries. In: Fleischmann B, Borgwardt KH, Klein R, Tuma A (eds) Operations research proceedings 2008. Springer, Berlin, pp 433\u2013438"},{"key":"390_CR10","unstructured":"Bienstock D (2001) Approximation algorithms for linear programming: theory and practice. CORE lecture series, Core, UCL, Belgium"},{"key":"390_CR11","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/ijoc.12.1.45.11902","volume":"12","author":"R Bixby","year":"2000","unstructured":"Bixby R, Martin A (2000) Parallelizing the dual simplex method. INFORMS J Comput 12: 45\u201356","journal-title":"INFORMS J Comput"},{"issue":"1","key":"390_CR12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1287\/opre.50.1.3.17780","volume":"50","author":"RE Bixby","year":"2002","unstructured":"Bixby RE (2002) Solving real-world linear programs: a decade and more of progress. Oper Res 50(1): 3\u201315","journal-title":"Oper Res"},{"key":"390_CR13","unstructured":"Bixby RE (2009) Lectures about LP and MIP solving at combinatorial optimization at work II"},{"key":"390_CR14","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0167-6377(94)90074-4","volume":"15","author":"RE Bixby","year":"1994","unstructured":"Bixby RE, Saltzman MJ (1994) Recovering an optimal basis from an interior point solution. Oper Res Lett 15: 169\u2013178","journal-title":"Oper Res Lett"},{"key":"390_CR15","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-540-73312-6_1","volume-title":"Computer-aided systems in public transport, vol 600 of lecture notes in economics and mathematical systems","author":"R Bornd\u00f6rfer","year":"2008","unstructured":"Bornd\u00f6rfer R, L\u00f6bel A, Weider S (2008) A bundle method for integrated multi-depot vehicle and duty scheduling in public transit. In: Hickman M, Mirchandani P, Vo\u00df S (eds) Computer-aided systems in public transport, vol 600 of lecture notes in economics and mathematical systems. Springer, Berlin, pp 3\u201324"},{"key":"390_CR16","unstructured":"Coleman TF, Czyzyk J, Sun C, Wagner M, Wright SJ (1997) ppcx: parallel software for linear programming. In: Proceedings of the eighth SIAM conference on parallel processing in scientific computing. SIAM. http:\/\/www.cs.cornell.edu\/Info\/People\/mwagner\/pPCx\/paper.ps"},{"key":"390_CR17","first-page":"104","volume-title":"In: Proceedings of the 15th conference on integer programming and combinatorial optimization","author":"W Cook","year":"2011","unstructured":"Cook W, Koch T, Steffy D, Wolter K (2011) An exact rational mixed integer programming solver. In: Proceedings of the 15th conference on integer programming and combinatorial optimization. Springer, Beriin, pp 104\u2013116"},{"issue":"2","key":"390_CR18","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1287\/ijoc.5.2.206","volume":"5","author":"W Cook","year":"1993","unstructured":"Cook W, Rutherford T, Scarf HE, Shallcross D (1993) An implementation of the generalized basis reduction algorithm for integer programming. ORSA J Comput 5(2): 206\u2013212","journal-title":"ORSA J Comput"},{"issue":"1","key":"390_CR19","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/ijoc.1040.0107","volume":"18","author":"G Corn\u00f9ejols","year":"2006","unstructured":"Corn\u00f9ejols G, Karamanov M, Li Y (2006) Early estimates of the size of branch-and-bound trees. INFORMS J Comput 18(1): 86\u201396","journal-title":"INFORMS J Comput"},{"issue":"6","key":"390_CR20","doi-asserted-by":"crossref","first-page":"3447","DOI":"10.1137\/090747634","volume":"32","author":"FE Curtis","year":"2010","unstructured":"Curtis FE, Schenk O, W\u00e4chter A (2010) An interior-point algorithm for large-scale nonlinear optimization with inexact step computations. SIAM J Sci Comput 32(6): 3447\u20133475","journal-title":"SIAM J Sci Comput"},{"issue":"12","key":"390_CR21","doi-asserted-by":"crossref","first-page":"1861","DOI":"10.1287\/mnsc.1040.0263","volume":"50","author":"ML Fisher","year":"2004","unstructured":"Fisher ML (2004) The lagrangian relaxation method for solving integer programming problems. Manag Sci 50(12): 1861\u20131871","journal-title":"Manag Sci"},{"key":"390_CR22","first-page":"239","volume-title":"Experimental algorithms, vol 6049 of lecture notes in computer science.","author":"G Gamrath","year":"2010","unstructured":"Gamrath G, L\u00fcbbecke M (2010) Experiments with a generic Dantzig-Wolfe decomposition for integer programs. In: Festa P (ed) Experimental algorithms, vol 6049 of lecture notes in computer science. Springer, Berlin, pp 239\u2013252"},{"key":"390_CR23","first-page":"125","volume":"83","author":"J Gondzio","year":"1998","unstructured":"Gondzio J (1998) Warm start of the primal-dual method applied in the cutting-plane scheme. Math Program 83: 125\u2013143","journal-title":"Math Program"},{"issue":"6","key":"390_CR24","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1287\/opre.32.6.1195","volume":"32","author":"M Gr\u00f6tschel","year":"1984","unstructured":"Gr\u00f6tschel M, J\u00fcnger M, Reinelt G (1984) A cutting plane algorithm for the linear ordering problem. Oper Res 32(6): 1195\u20131220","journal-title":"Oper Res"},{"key":"390_CR25","unstructured":"Gupta A, Kumar V (1994) A scalable parallel algorithm for sparse cholesky factorization. In: Proceedings of the 1994 conference on supercomputing, supercomputing \u201994, IEEE Computer Society Press, Los Alamitos, CA, USA, pp 793\u2013802"},{"key":"390_CR26","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s10287-008-0080-5","volume":"7","author":"J Hall","year":"2010","unstructured":"Hall J (2010) Towards a practical parallelisation of the simplex method. Comput Manag Sci 7: 139\u2013170","journal-title":"Comput Manag Sci"},{"key":"390_CR27","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s101070100270","volume":"93","author":"C Helmberg","year":"2002","unstructured":"Helmberg C, Kiwiel K (2002) A spectral bundle method with bounds. Math Program 93: 173\u2013194","journal-title":"Math Program"},{"key":"390_CR28","doi-asserted-by":"crossref","unstructured":"Ivanov ID, de Klerk E (2007) Parallel implementation of a semidefinite programming solver based on CSDP in a distributed memory cluster. Technical Report CentER Discussion Paper 2007-20. Tilburg University, The Netherlands","DOI":"10.2139\/ssrn.987781"},{"key":"390_CR29","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s10589-007-9096-y","volume":"41","author":"E John","year":"2008","unstructured":"John E, Yildirim EA (2008) Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension. Comput Optim Appl 41: 151\u2013183","journal-title":"Comput Optim Appl"},{"issue":"2","key":"390_CR30","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0167-6377(00)00017-1","volume":"27","author":"D Klabjan","year":"2000","unstructured":"Klabjan D, Johnson EL, Nemhauser GL (2000) A parallel primal-dual simplex algorithm. Oper Res Lett 27(2): 47\u201355","journal-title":"Oper Res Lett"},{"key":"390_CR31","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch T, Achterberg T, Andersen E, Bastert O, Berthold T, Bixby RE, Danna E, Gamrath G, Gleixner AM, Heinz S, Lodi A, Mittelmann H, Ralphs T, Salvagnin D, Steffy DE, Wolter K (2011) MIPLIB 2010. Math Program Comput 3: 103\u2013163","journal-title":"Math Program Comput"},{"key":"390_CR32","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/BF01389001","volume":"16","author":"V Kumar","year":"1987","unstructured":"Kumar V, Rao VN (1987) Parallel depth-first search, part II: analysis. Int J Parallel Program 16: 501\u2013519","journal-title":"Int J Parallel Program"},{"key":"390_CR33","unstructured":"Levinthal D (2009) Performance analysis guide for Intel core i7 processor and Intel Xeon 5500 processors"},{"key":"390_CR34","doi-asserted-by":"crossref","unstructured":"Mahajan A, Ralphs TK (2009) Experiments with branching using general disjunctions. In: Proceedings of the leventh INFORMS Computing Society Meeting, pp 101\u2013118","DOI":"10.1007\/978-0-387-88843-9_6"},{"issue":"5","key":"390_CR35","doi-asserted-by":"crossref","first-page":"2181","DOI":"10.1137\/080737587","volume":"20","author":"A Mahajan","year":"2010","unstructured":"Mahajan A, Ralphs TK (2010) On the Complexity of selecting disjunctions in integer programming. SIAM J Optim 20(5): 2181\u20132198","journal-title":"SIAM J Optim"},{"key":"390_CR36","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1007\/978-3-540-68279-0_17","volume-title":"Fifty years of integer programming: 1958\u20132008","author":"F Margot","year":"2010","unstructured":"Margot F (2010) Symmetry in integer linear programming. In: J\u00fcnger M, Liebling T, Naddef D, Nemhauser G, Pulleyblank W, Reinelt G, Rinaldi G, Wolsey L (eds) Fifty years of integer programming: 1958\u20132008. Springer, Berlin, pp 647\u2013686"},{"issue":"1","key":"390_CR37","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1287\/ijoc.3.1.63","volume":"3","author":"N Megiddo","year":"1991","unstructured":"Megiddo N (1991) On finding primal\u2014and dual-optimal bases. ORSA J Comput 3(1): 63\u201365","journal-title":"ORSA J Comput"},{"key":"390_CR38","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/1508284.1508256","volume":"44","author":"M Olszewski","year":"2009","unstructured":"Olszewski M, Ansel J, Amarasinghe S (2009) Kendo: efficient deterministic multithreading in software. SIGPLAN Not 44: 97\u2013108","journal-title":"SIGPLAN Not"},{"issue":"3","key":"390_CR39","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1287\/ijoc.1100.0405","volume":"23","author":"OY \u00d6zaltin","year":"2011","unstructured":"\u00d6zaltin OY, Hunsaker B, Schaefer AJ (2011) Predicting the solution time of branch-and-bound algorithms for mixed-integer programs. INFORMS J Comput 23(3): 392\u2013403","journal-title":"INFORMS J Comput"},{"key":"390_CR40","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M Padberg","year":"1991","unstructured":"Padberg M, Rinaldi G (1991) A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev 33: 60\u2013100","journal-title":"SIAM Rev"},{"key":"390_CR41","unstructured":"Paper W (2010) SGI Altix global shared memory performance and productivity breakthroughs for the SGI Altix UV. http:\/\/www.sgi.com\/pdfs\/4250.pdf"},{"key":"390_CR42","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/1.9780898718133.ch17","volume-title":"Parallel processing for scientific computing","author":"C Phillips","year":"2006","unstructured":"Phillips C, Eckstein J, Hart W (2006) Massively parallel mixed-integer programming: algorithms and applications. In: Heroux M, Raghavan P, Simon H (eds) Parallel processing for scientific computing. SIAM Books, Philadelphia, pp 323\u2013340"},{"key":"390_CR43","unstructured":"Rothberg E (2010) Barrier is from mars, simplex is from venus. Talk given at What a pivot\u2013workshop honouring the 65th birthday of Bob Bixby in Erlangen, Germany"},{"key":"390_CR44","doi-asserted-by":"crossref","unstructured":"Schroeder B, Pinheiro E, Weber W-D (2009) DRAM errors in the wild: a large-scale field study. In: Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems, SIGMETRICS \u201909, ACM, pp 193\u2013204","DOI":"10.1145\/1555349.1555372"},{"key":"390_CR45","first-page":"135","volume-title":"Competence in high performance computing 2010","author":"Y Shinano","year":"2012","unstructured":"Shinano Y, Achterberg T, Berthold T, Heinz S, Koch T (2012) ParaSCIP\u2014a parallel extension of SCIP. In: Bischof C, Hegering H-G, Nagel WE, Wittum G (eds) Competence in high performance computing 2010. Springer, Berlin, pp 135\u2013148"},{"key":"390_CR46","volume-title":"Integer programming","author":"LA Wolsey","year":"1998","unstructured":"Wolsey LA (1998) Integer programming. Wiley-Interscience, New York"},{"key":"390_CR47","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/216585.216588","volume":"23","author":"WA Wulf","year":"1995","unstructured":"Wulf WA, McKee SA (1995) Hitting the memory wall: implications of the obvious. SIGARCH Comput Archit News 23: 20\u201324","journal-title":"SIGARCH Comput Archit News"},{"key":"390_CR48","unstructured":"Wunderling R (1996) Paralleler und objektorientierter Simplex-Algorithmus. PhD thesis, Technische Universit\u00e4t, Berlin"},{"key":"390_CR49","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1287\/ijoc.1090.0347","volume":"21","author":"Y Xu","year":"2009","unstructured":"Xu Y, Ralphs TK, Lad\u00e1nyi L, Saltzman MJ (2009) Computational experience with a software framework for parallel integer programming. INFORMS J Comput 21: 383\u2013397","journal-title":"INFORMS J Comput"},{"key":"390_CR50","doi-asserted-by":"crossref","unstructured":"Yamashita M, Fujisawa K (2010) Efficient parallel software for large-scale semidefinite programs. In: Proceedings of the 2010 IEEE multi-conference on systems and control","DOI":"10.1109\/CACSD.2010.5612812"},{"key":"390_CR51","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1016\/S0167-8191(03)00087-5","volume":"29","author":"M Yamashita","year":"2003","unstructured":"Yamashita M, Fujisawa K, Kojima M (2003) SDPARA : semidefinite programming algorithm parallel version. Parallel Comput 29: 1053\u20131067","journal-title":"Parallel Comput"},{"key":"390_CR52","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1137\/S1052623400369235","volume":"12","author":"A Yildirim","year":"2000","unstructured":"Yildirim A, Stephen, Wright S (2000) Warm-start strategies in interior-point methods for linear programming. SIAM J Optim 12: 782\u2013810","journal-title":"SIAM J Optim"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-012-0390-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-012-0390-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-012-0390-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T08:41:44Z","timestamp":1594111304000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-012-0390-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,9]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["390"],"URL":"https:\/\/doi.org\/10.1007\/s00186-012-0390-9","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,9]]}}}