{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:44:46Z","timestamp":1725651886405},"reference-count":73,"publisher":"Association for Computing Machinery (ACM)","issue":"2","funder":[{"name":"German Federal Ministry of Education and Research","award":["05M14ZAM"]},{"name":"European Union\u2019s Horizon 2020 research and innovation programme","award":["773897"]},{"name":"German Research Foundation (DFG) within the Collaborative Research Center"},{"name":"EXPRESS project of the priority program CoSIP","award":["DFG-SPP 1798"]},{"name":"German Research Foundation (DFG) within the project HPO-NAVI","award":["391087700"]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Math. Softw."],"published-print":{"date-parts":[[2023,6,30]]},"abstract":"\n The\n SCIP<\/jats:sc>\n Optimization Suite provides a collection of software packages for mathematical optimization centered around the constraint integer programming framework\n SCIP<\/jats:sc>\n . The focus of this article is on the role of the\n SCIP<\/jats:sc>\n Optimization Suite in supporting research.\n SCIP<\/jats:sc>\n \u2019s main design principles are discussed, followed by a presentation of the latest performance improvements and developments in version 8.0, which serve both as examples of\n SCIP<\/jats:sc>\n \u2019s application as a research tool and as a platform for further developments. Furthermore, this article gives an overview of interfaces to other programming and modeling languages, new features that expand the possibilities for user interaction with the framework, and the latest developments in several extensions built upon\n SCIP<\/jats:sc>\n .\n <\/jats:p>","DOI":"10.1145\/3585516","type":"journal-article","created":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T11:46:14Z","timestamp":1678448774000},"page":"1-21","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Enabling Research through the SCIP Optimization Suite 8.0"],"prefix":"10.1145","volume":"49","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-7018-7099","authenticated-orcid":false,"given":"Ksenia","family":"Bestuzheva","sequence":"first","affiliation":[{"name":"Zuse Institute Berlin, Department AIS2T"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-6284-3033","authenticated-orcid":false,"given":"Mathieu","family":"Besan\u00e7on","sequence":"additional","affiliation":[{"name":"Zuse Institute Berlin, Department AIS2T"}]},{"ORCID":"http:\/\/orcid.org\/0000-0003-4147-1346","authenticated-orcid":false,"given":"Wei-Kun","family":"Chen","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, School of Mathematics and Statistics"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-4809-2958","authenticated-orcid":false,"given":"Antonia","family":"Chmiela","sequence":"additional","affiliation":[{"name":"Zuse Institute Berlin, Department AIS2T"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-5721-3563","authenticated-orcid":false,"given":"Tim","family":"Donkiewicz","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Lehrstuhl f\u00fcr Operations Research"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-2494-0705","authenticated-orcid":false,"given":"Jasper","family":"van Doornmalen","sequence":"additional","affiliation":[{"name":"Eindhoven University of Technology, Department of Mathematics and Computer Science"}]},{"ORCID":"http:\/\/orcid.org\/0000-0003-0245-9344","authenticated-orcid":false,"given":"Leon","family":"Eifler","sequence":"additional","affiliation":[{"name":"Zuse Institute Berlin, Department AIS2T"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-2131-1911","authenticated-orcid":false,"given":"Oliver","family":"Gaul","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Lehrstuhl f\u00fcr Operations Research"}]},{"ORCID":"http:\/\/orcid.org\/0000-0001-6141-5937","authenticated-orcid":false,"given":"Gerald","family":"Gamrath","sequence":"additional","affiliation":[{"name":"Zuse Institute Berlin, Department AIS2T and I2DAMO GmbH"}]},{"ORCID":"http:\/\/orcid.org\/0000-0003-0391-5903","authenticated-orcid":false,"given":"Ambros","family":"Gleixner","sequence":"additional","affiliation":[{"name":"Zuse Institute Berlin, Department AIS2T and HTW Berlin"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-8894-5011","authenticated-orcid":false,"given":"Leona","family":"Gottwald","sequence":"additional","affiliation":[{"name":"Zuse Institute Berlin, Department AIS2T"}]},{"ORCID":"http:\/\/orcid.org\/0000-0001-8990-9912","authenticated-orcid":false,"given":"Christoph","family":"Graczyk","sequence":"additional","affiliation":[{"name":"Zuse Institute Berlin, Department AIS2T"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-8730-3447","authenticated-orcid":false,"given":"Katrin","family":"Halbig","sequence":"additional","affiliation":[{"name":"Friedrich-Alexander Universit\u00e4t Erlangen-N\u00fcrnberg, Department of Data Science"}]},{"ORCID":"http:\/\/orcid.org\/0000-0003-1065-1651","authenticated-orcid":false,"given":"Alexander","family":"Hoen","sequence":"additional","affiliation":[{"name":"Zuse Institute Berlin, Department AIS2T"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-5324-8996","authenticated-orcid":false,"given":"Christopher","family":"Hojny","sequence":"additional","affiliation":[{"name":"Eindhoven University of Technology, Department of Mathematics and Computer Science"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-5941-3016","authenticated-orcid":false,"given":"Rolf","family":"van der Hulst","sequence":"additional","affiliation":[{"name":"University of Twente, Department of Discrete Mathematics and Mathematical Programming"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-1967-0077","authenticated-orcid":false,"given":"Thorsten","family":"Koch","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Berlin and Zuse Institute Berlin, Department A2IM"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-2635-0522","authenticated-orcid":false,"given":"Marco","family":"L\u00fcbbecke","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Lehrstuhl f\u00fcr Operations Research"}]},{"ORCID":"http:\/\/orcid.org\/0000-0003-3773-6882","authenticated-orcid":false,"given":"Stephen J.","family":"Maher","sequence":"additional","affiliation":[{"name":"University of Exeter, College of Engineering, Mathematics and Physical Sciences"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-0499-1820","authenticated-orcid":false,"given":"Frederic","family":"Matter","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Darmstadt, Fachbereich Mathematik"}]},{"ORCID":"http:\/\/orcid.org\/0000-0003-1114-3800","authenticated-orcid":false,"given":"Erik","family":"M\u00fchmer","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Lehrstuhl f\u00fcr Operations Research"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-4463-2873","authenticated-orcid":false,"given":"Benjamin","family":"M\u00fcller","sequence":"additional","affiliation":[{"name":"Zuse Institute Berlin, Department AIS2T"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-0947-7193","authenticated-orcid":false,"given":"Marc E.","family":"Pfetsch","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Darmstadt, Fachbereich Mathematik"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-2877-074X","authenticated-orcid":false,"given":"Daniel","family":"Rehfeldt","sequence":"additional","affiliation":[{"name":"Zuse Institute Berlin, Department A2IM"}]},{"ORCID":"http:\/\/orcid.org\/0009-0003-8322-7226","authenticated-orcid":false,"given":"Steffan","family":"Schlein","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Lehrstuhl f\u00fcr Operations Research"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-3716-5031","authenticated-orcid":false,"given":"Franziska","family":"Schl\u00f6sser","sequence":"additional","affiliation":[{"name":"Zuse Institute Berlin, Department AIS2T"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-7892-3951","authenticated-orcid":false,"given":"Felipe","family":"Serrano","sequence":"additional","affiliation":[{"name":"Zuse Institute Berlin, Department AIS2T"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-2902-882X","authenticated-orcid":false,"given":"Yuji","family":"Shinano","sequence":"additional","affiliation":[{"name":"Zuse Institute Berlin, Department A2IM"}]},{"ORCID":"http:\/\/orcid.org\/0000-0003-2252-9469","authenticated-orcid":false,"given":"Boro","family":"Sofranac","sequence":"additional","affiliation":[{"name":"Zuse Institute Berlin, Department AIS2T and Technische Universit\u00e4t Berlin"}]},{"ORCID":"http:\/\/orcid.org\/0000-0001-7270-1496","authenticated-orcid":false,"given":"Mark","family":"Turner","sequence":"additional","affiliation":[{"name":"Zuse Institute Berlin, Department A2IM and Technische Universit\u00e4t Berlin"}]},{"ORCID":"http:\/\/orcid.org\/0009-0001-2262-0601","authenticated-orcid":false,"given":"Stefan","family":"Vigerske","sequence":"additional","affiliation":[{"name":"GAMS Software GmbH, c\/o Zuse Institute Berlin, Department AIS2T"}]},{"ORCID":"http:\/\/orcid.org\/0009-0000-8100-6751","authenticated-orcid":false,"given":"Fabian","family":"Wegscheider","sequence":"additional","affiliation":[{"name":"Zuse Institute Berlin, Department AIS2T"}]},{"ORCID":"http:\/\/orcid.org\/0009-0001-1109-3877","authenticated-orcid":false,"given":"Philipp","family":"Wellner","sequence":"additional","affiliation":[{"name":"Zuse Institute Berlin, Department AIS2T"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-1333-8591","authenticated-orcid":false,"given":"Dieter","family":"Weninger","sequence":"additional","affiliation":[{"name":"Friedrich-Alexander Universit\u00e4t Erlangen-N\u00fcrnberg, Department of Data Science"}]},{"ORCID":"http:\/\/orcid.org\/0000-0003-2698-0767","authenticated-orcid":false,"given":"Jakob","family":"Witzig","sequence":"additional","affiliation":[{"name":"Zuse Institute Berlin, Department AIS2T"}]}],"member":"320","published-online":{"date-parts":[[2023,6,15]]},"reference":[{"key":"e_1_3_2_2_2","volume-title":"Constraint Integer Programming","author":"Achterberg T.","year":"2007","unstructured":"T. Achterberg. 2007. Constraint Integer Programming. Dissertation. Technische Universit\u00e4t Berlin."},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-008-0001-1"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2018.0857"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.32.10.1274"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.38.2.217"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581249"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01556-4"},{"key":"e_1_3_2_9_2","volume-title":"The SCIP Optimization Suite 8.0","author":"Bestuzheva Ksenia","year":"2021","unstructured":"Ksenia Bestuzheva, Mathieu Besan\u00e7on, Wei-Kun Chen, Antonia Chmiela, Tim Donkiewicz, Jasper van Doornmalen, Leon Eifler, Oliver Gaul, Gerald Gamrath, Ambros Gleixner, Leona Gottwald, Christoph Graczyk, Katrin Halbig, Alexander Hoen, Christopher Hojny, Rolf van der Hulst, Thorsten Koch, Marco L\u00fcbbecke, Stephen J. Maher, Frederic Matter, Erik M\u00fchmer, Benjamin M\u00fcller, Marc E. Pfetsch, Daniel Rehfeldt, Steffan Schlein, Franziska Schl\u00f6sser, Felipe Serrano, Yuji Shinano, Boro Sofranac, Mark Turner, Stefan Vigerske, Fabian Wegscheider, Philipp Wellner, Dieter Weninger, and Jakob Witzig. 2021. The SCIP Optimization Suite 8.0. Technical Report. Optimization Online. Retrieved from http:\/\/www.optimization-online.org\/DB_HTML\/2021\/12\/8728.html."},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105124"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.IPEC.2018.26"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105191"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2020.10.005"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/s43069-020-00052-x"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1095-2"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-021-00621-4"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-019-03145-x"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-021-09413-z"},{"key":"e_1_3_2_19_2","volume-title":"Solving Challenging Large Scale QAPs","author":"Fujii Koichi","year":"2021","unstructured":"Koichi Fujii, Naoki Ito, Sunyoung Kim, Masakazu Kojima, Yuji Shinano, and Kim-Chuan Toh. 2021. Solving Challenging Large Scale QAPs. ZIB-Report 21-02. Zuse Institute Berlin."},{"key":"e_1_3_2_20_2","volume-title":"Computational Mixed-Integer Semidefinite Programming","author":"Gally Tristan","year":"2019","unstructured":"Tristan Gally. 2019. Computational Mixed-Integer Semidefinite Programming. Dissertation. TU Darmstadt."},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2017.1322081"},{"key":"e_1_3_2_22_2","volume-title":"The SCIP Optimization Suite 7.0","author":"Gamrath Gerald","year":"2020","unstructured":"Gerald Gamrath, Daniel Anderson, Ksenia Bestuzheva, Wei-Kun Chen, Leon Eifler, Maxime Gasse, Patrick Gemander, Ambros Gleixner, Leona Gottwald, Katrin Halbig, Gregor Hendel, Christopher Hojny, Thorsten Koch, Pierre Le Bodic, Stephen J. Maher, Frederic Matter, Matthias Miltenberger, Erik M\u00fchmer, Benjamin M\u00fcller, Marc E. Pfetsch, Franziska Schl\u00f6sser, Felipe Serrano, Yuji Shinano, Christine Tawfik, Stefan Vigerske, Fabian Wegscheider, Dieter Weninger, and Jakob Witzig. 2020. The SCIP Optimization Suite 7.0. Technical Report. Optimization Online. Retrieved from http:\/\/www.optimization-online.org\/DB_HTML\/2020\/03\/7705.html."},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-016-0114-x"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13193-6_21"},{"key":"e_1_3_2_25_2","volume-title":"Hierarchical Strong Branching and Other Strong Branching-Based Branching Candidate Selection Heuristics in Branch-and-Price","author":"Gaul Oliver","year":"2021","unstructured":"Oliver Gaul. 2021. Hierarchical Strong Branching and Other Strong Branching-Based Branching Candidate Selection Heuristics in Branch-and-Price. Master\u2019s thesis. RWTH Aachen University."},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1137\/16M1069687"},{"key":"e_1_3_2_27_2","volume-title":"The SCIP Optimization Suite 6.0","author":"Gleixner Ambros","year":"2018","unstructured":"Ambros Gleixner, Michael Bastubbe, Leon Eifler, Tristan Gally, Gerald Gamrath, Robert Lion Gottwald, Gregor Hendel, Christopher Hojny, Thorsten Koch, Marco E. L\u00fcbbecke, Stephen J. Maher, Matthias Miltenberger, Benjamin M\u00fcller, Marc E. Pfetsch, Christian Puchert, Daniel Rehfeldt, Franziska Schl\u00f6sser, Christoph Schubert, Felipe Serrano, Yuji Shinano, Jan Merlin Viernickel, Matthias Walter, Fabian Wegscheider, Jonas T. Witt, and Jakob Witzig. 2018. The SCIP Optimization Suite 6.0. Technical Report. Optimization Online. Retrieved from http:\/\/www.optimization-online.org\/DB_HTML\/2018\/07\/6692.html."},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-020-00194-3"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1239-7"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011520"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-018-0135-8"},{"key":"e_1_3_2_32_2","volume-title":"Progress in Combinatorial Optimization","author":"Kaibel Volker","year":"2011","unstructured":"Volker Kaibel and Andreas Loos. 2011. Finding descriptions of polytopes via extended formulations and liftings. In Progress in Combinatorial Optimization. A. Ridha Mahjoub (Ed.), Wiley."},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-020-00199-y"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_3_2_35_2","volume-title":"Rapid Mathematical Prototyping","author":"Koch Thorsten","year":"2004","unstructured":"Thorsten Koch. 2004. Rapid Mathematical Prototyping. Dissertation. Technische Universit\u00e4t Berlin."},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0255-1_9"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-013-0106-6"},{"key":"e_1_3_2_38_2","author":"T. Linderoth Jeffrey","year":"2005","unstructured":"Jeffrey T. Linderoth and Ted K. Ralphs. 2005. Noncommercial software for mixed-integer linear programming. Integer Programming: Theory and Practice (2005), 269--320.","journal-title":"Integer Programming: Theory and Practice"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42432-3_37"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0358-2"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0394-6"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68279-0_17"},{"key":"e_1_3_2_43_2","volume-title":"Mixed-Integer Semidefinite Programming with an Application to Truss Topology Design","author":"Mars Sonja","year":"2013","unstructured":"Sonja Mars. 2013. Mixed-Integer Semidefinite Programming with an Application to Truss Topology Design. Dissertation. FAU Erlangen-N\u00fcrnberg."},{"key":"e_1_3_2_44_2","volume-title":"Presolving for Mixed-Integer Semidefinite Optimization","author":"Matter Frederic","year":"2021","unstructured":"Frederic Matter and Marc E. Pfetsch. 2021. Presolving for Mixed-Integer Semidefinite Optimization. Technical Report. Optimization Online. Retrieved from http:\/\/www.optimization-online.org\/DB_HTML\/2021\/10\/8614.html."},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2016.159"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-019-00074-0"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0273-x"},{"key":"e_1_3_2_48_2","volume-title":"Algorithms for the Steiner Problem in Networks","author":"Polzin Tobias","year":"2003","unstructured":"Tobias Polzin. 2003. Algorithms for the Steiner Problem in Networks. Dissertation. Saarland University."},{"key":"e_1_3_2_49_2","unstructured":"Antoine Prouvost Justin Dumouchelle Maxime Gasse Didier Ch\u00e9telat and Andrea Lodi. 2021. Ecole: A library for learning inside MILP solvers. arXiv:2104.02828. Retrieved from https:\/\/arxiv.org\/abs\/2104.02828."},{"key":"e_1_3_2_50_2","volume-title":"Faster Algorithms for Steiner Tree and Related Problems: From Theory to Practice","author":"Rehfeldt Daniel","year":"2021","unstructured":"Daniel Rehfeldt. 2021. Faster Algorithms for Steiner Tree and Related Problems: From Theory to Practice. Dissertation. Technische Universit\u00e4t Berlin."},{"key":"e_1_3_2_51_2","volume-title":"Optimal Connected Subgraphs: Formulations and Algorithms","author":"Rehfeldt Daniel","year":"2020","unstructured":"Daniel Rehfeldt, Henriette Franz, and Thorsten Koch. 2020. Optimal Connected Subgraphs: Formulations and Algorithms. ZIB-Report 20-23. Zuse Institute Berlin."},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-021-01757-5"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2021.1087"},{"key":"e_1_3_2_54_2","first-page":"269","volume-title":"Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling","author":"Ryan D. M.","year":"1981","unstructured":"D. M. Ryan and B. A. Foster. 1981. An integer programming approach to scheduling. In Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling. A. Wren (Ed.), North Holland, Amsterdam, 269\u2013280."},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93031-2_37"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2020.02.006"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013819515732"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-89920-6_20"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24025-6_12"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2016.56"},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2018.1428602"},{"key":"e_1_3_2_62_2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2017.0762"},{"key":"e_1_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2019.00095"},{"key":"e_1_3_2_64_2","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/978-3-030-19212-9_35","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"Shinano Yuji","year":"2019","unstructured":"Yuji Shinano, Daniel Rehfeldt, and Thorsten Koch. 2019. Building optimal Steiner trees on supercomputers by using up to 43,000 cores. In Integration of Constraint Programming, Artificial Intelligence, and Operations Research. Louis-Martin Rousseau and Kostas Stergiou (Eds.), Springer, Cham, 529\u2013539."},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","DOI":"10.1016\/s0098-1354(98)00286-5"},{"key":"e_1_3_2_66_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC41405.2020.00064"},{"key":"e_1_3_2_67_2","volume-title":"CMAP-LAP: Configurable Massively Parallel Solver for Lattice Problems","author":"Tateiwa Nariaki","year":"2021","unstructured":"Nariaki Tateiwa, Yuji Shinano, Keiichiro Yamamura, Akihiro Yoshida, Shizuo Kaji, Masaya Yasuda, and Katsuki Fujisawa. 2021. CMAP-LAP: Configurable Massively Parallel Solver for Lattice Problems. ZIB-Report 21-16. Zuse Institute Berlin."},{"key":"e_1_3_2_68_2","volume-title":"Massively Parallel Sharing Lattice Basis Reduction","author":"Tateiwa Nariaki","year":"2021","unstructured":"Nariaki Tateiwa, Yuji Shinano, Masaya Yasuda, Keiichiro Yamamura, Shizuo Kaji, and Katsuki Fujisawa. 2021. Massively Parallel Sharing Lattice Basis Reduction. ZIB-Report 21-38. Zuse Institute Berlin."},{"key":"e_1_3_2_69_2","volume-title":"Algorithmic Approaches to the Steiner Problem in Networks","author":"Daneshmand Siavash Vahdati","year":"2004","unstructured":"Siavash Vahdati Daneshmand. 2004. Algorithmic Approaches to the Steiner Problem in Networks. Dissertation. Universit\u00e4t Mannheim."},{"key":"e_1_3_2_70_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0334-1"},{"key":"e_1_3_2_71_2","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2017.1335312"},{"key":"e_1_3_2_72_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-005-3455-9"},{"key":"e_1_3_2_73_2","volume-title":"Exploiting Symmetry in Mixed-Integer Nonlinear Programming","author":"Wegscheider Fabian","year":"2019","unstructured":"Fabian Wegscheider. 2019. Exploiting Symmetry in Mixed-Integer Nonlinear Programming. Master\u2019s thesis. Zuse Institute Berlin."},{"key":"e_1_3_2_74_2","volume-title":"Paralleler und Objektorientierter Simplex-Algorithmus","author":"Wunderling Roland","year":"1996","unstructured":"Roland Wunderling. 1996. Paralleler und Objektorientierter Simplex-Algorithmus. Dissertation. Technische Universit\u00e4t Berlin."}],"container-title":["ACM Transactions on Mathematical Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3585516","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,15]],"date-time":"2023-06-15T14:16:34Z","timestamp":1686838594000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3585516"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,15]]},"references-count":73,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,6,30]]}},"alternative-id":["10.1145\/3585516"],"URL":"https:\/\/doi.org\/10.1145\/3585516","relation":{},"ISSN":["0098-3500","1557-7295"],"issn-type":[{"value":"0098-3500","type":"print"},{"value":"1557-7295","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,15]]},"assertion":[{"value":"2022-06-17","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-02-02","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-06-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}
