MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library

We report on the selection process leading to the sixth version of the Mixed Integer Programming Library, MIPLIB 2017. Selected from an initial pool of 5721 instances, the new MIPLIB 2017 collection consists of 1065 instances. A subset of 240 instances was specially selected for benchmarking solver...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming computation Vol. 13; no. 3; pp. 443 - 490
Main Authors:	Gleixner, Ambros, Hendel, Gregor, Gamrath, Gerald, Achterberg, Tobias, Bastubbe, Michael, Berthold, Timo, Christophel, Philipp, Jarck, Kati, Koch, Thorsten, Linderoth, Jeff, Lübbecke, Marco, Mittelmann, Hans D., Ozyurt, Derya, Ralphs, Ted K., Salvagnin, Domenico, Shinano, Yuji
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2021 Springer Nature B.V
Subjects:	Full Length Paper Integer programming Libraries Mathematics Mathematics and Statistics Mathematics of Computing Mixed integer Operations Research/Decision Theory Optimization Theory of Computation 90C10 Mixed integer linear optimization MIP 90C11 90C06 Benchmarking Instance library Selection methodology 90C09
ISSN:	1867-2949, 1867-2957
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	We report on the selection process leading to the sixth version of the Mixed Integer Programming Library, MIPLIB 2017. Selected from an initial pool of 5721 instances, the new MIPLIB 2017 collection consists of 1065 instances. A subset of 240 instances was specially selected for benchmarking solver performance. For the first time, these sets were compiled using a data-driven selection process supported by the solution of a sequence of mixed integer optimization problems, which encode requirements on diversity and balancedness with respect to instance features and performance data.
AbstractList	We report on the selection process leading to the sixth version of the Mixed Integer Programming Library, MIPLIB 2017. Selected from an initial pool of 5721 instances, the new MIPLIB 2017 collection consists of 1065 instances. A subset of 240 instances was specially selected for benchmarking solver performance. For the first time, these sets were compiled using a data-driven selection process supported by the solution of a sequence of mixed integer optimization problems, which encode requirements on diversity and balancedness with respect to instance features and performance data.
Author	Bastubbe, Michael Linderoth, Jeff Ozyurt, Derya Gamrath, Gerald Achterberg, Tobias Berthold, Timo Lübbecke, Marco Mittelmann, Hans D. Hendel, Gregor Shinano, Yuji Jarck, Kati Ralphs, Ted K. Gleixner, Ambros Christophel, Philipp Koch, Thorsten Salvagnin, Domenico
Author_xml	– sequence: 1 givenname: Ambros orcidid: 0000-0003-0391-5903 surname: Gleixner fullname: Gleixner, Ambros email: gleixner@zib.de organization: Zuse Institute Berlin – sequence: 2 givenname: Gregor orcidid: 0000-0001-7132-5142 surname: Hendel fullname: Hendel, Gregor organization: Zuse Institute Berlin – sequence: 3 givenname: Gerald orcidid: 0000-0001-6141-5937 surname: Gamrath fullname: Gamrath, Gerald organization: Zuse Institute Berlin – sequence: 4 givenname: Tobias surname: Achterberg fullname: Achterberg, Tobias organization: Gurobi GmbH – sequence: 5 givenname: Michael orcidid: 0000-0002-4416-925X surname: Bastubbe fullname: Bastubbe, Michael organization: Lehrstuhl für Operations Research, RWTH Aachen University – sequence: 6 givenname: Timo orcidid: 0000-0002-6320-8154 surname: Berthold fullname: Berthold, Timo organization: Fair Isaac Germany GmbH – sequence: 7 givenname: Philipp orcidid: 0000-0002-3036-7239 surname: Christophel fullname: Christophel, Philipp organization: Operations Research R&D, Advanced Analytics Division, SAS Institute Inc – sequence: 8 givenname: Kati surname: Jarck fullname: Jarck, Kati organization: MOSEK ApS – sequence: 9 givenname: Thorsten orcidid: 0000-0002-1967-0077 surname: Koch fullname: Koch, Thorsten organization: Zuse Institute Berlin – sequence: 10 givenname: Jeff orcidid: 0000-0003-4442-3059 surname: Linderoth fullname: Linderoth, Jeff organization: Department of Industrial and Systems Engineering & Wisconsin Institute for Discovery, University of Wisconsin-Madison – sequence: 11 givenname: Marco orcidid: 0000-0002-2635-0522 surname: Lübbecke fullname: Lübbecke, Marco organization: Lehrstuhl für Operations Research, RWTH Aachen University – sequence: 12 givenname: Hans D. orcidid: 0000-0003-1961-657X surname: Mittelmann fullname: Mittelmann, Hans D. organization: School of Mathematical and Statistical Sciences, Arizona State University – sequence: 13 givenname: Derya orcidid: 0000-0002-2943-7762 surname: Ozyurt fullname: Ozyurt, Derya organization: The MathWorks, Inc – sequence: 14 givenname: Ted K. orcidid: 0000-0002-4306-9089 surname: Ralphs fullname: Ralphs, Ted K. organization: Department of Industrial and Systems Engineering, Lehigh University – sequence: 15 givenname: Domenico orcidid: 0000-0002-0232-2244 surname: Salvagnin fullname: Salvagnin, Domenico organization: Department of Information Engineering, University of Padova – sequence: 16 givenname: Yuji orcidid: 0000-0002-2902-882X surname: Shinano fullname: Shinano, Yuji organization: Zuse Institute Berlin
BookMark	eNp9kM1KAzEYRYNUsNa-gKuA62j-Jpm40-JPoaKIrkNmJtOmdDI1k4q-jc_ikxk7ouCi2SR83JPvcg7BwLfeAnBM8CnBWJ51hGaMIkwxwpgojtgeGJJcSERVJge_b64OwLjrljgdRmXO1BA83k0fZtNLSDGR57Ay0aAquFfrYdk2a7cy0bUetjWMCwtFXHx-NO7NVsj5aOc2wHVo58E0jfNzuHJFMOH9COzXZtXZ8c89As_XV0-TWzS7v5lOLmao5FRFxAkjtGAkq62sCWO2ygphamOVSEMla8mtEEUpCp6LrKyMsTwztEpppopcshE46f9NHV42tot62W6CTys1zQSlXEnBU4r2qTK0XRdsrdfBNammJlh_69O9Pp306a0-zRKU_4NKF7cqYjButRtlPdqlPT4p-mu1g_oCD26FnA
CitedBy_id	crossref_primary_10_1145_3689795 crossref_primary_10_1080_23249935_2023_2259014 crossref_primary_10_1007_s10107_025_02227_y crossref_primary_10_1007_s10107_024_02135_7 crossref_primary_10_1007_s10107_024_02080_5 crossref_primary_10_1109_TASE_2023_3322786 crossref_primary_10_1111_anzs_12441 crossref_primary_10_1287_ijoc_2024_0844 crossref_primary_10_1287_ijoc_2022_0164 crossref_primary_10_1016_j_compchemeng_2024_108897 crossref_primary_10_1007_s10107_024_02130_y crossref_primary_10_1109_TPWRS_2023_3258699 crossref_primary_10_1287_ijoo_2023_0091 crossref_primary_10_1016_j_ejco_2022_100031 crossref_primary_10_1016_j_artint_2025_104405 crossref_primary_10_1016_j_procs_2023_08_133 crossref_primary_10_1016_j_procs_2023_08_132 crossref_primary_10_1109_TPWRS_2024_3438769 crossref_primary_10_14529_mmp240305 crossref_primary_10_3390_fi12110185 crossref_primary_10_1007_s12532_023_00240_w crossref_primary_10_1016_j_knosys_2022_109455 crossref_primary_10_1145_3585516 crossref_primary_10_1007_s10107_021_01749_5 crossref_primary_10_1145_3711935 crossref_primary_10_1287_ijoc_2022_0188 crossref_primary_10_1109_LCSYS_2023_3286451 crossref_primary_10_1109_TCAD_2023_3274050 crossref_primary_10_1109_TPAMI_2024_3432716 crossref_primary_10_1007_s12532_022_00221_5 crossref_primary_10_1007_s12532_023_00234_8 crossref_primary_10_1007_s10107_024_02102_2 crossref_primary_10_1007_s10107_024_02104_0 crossref_primary_10_1007_s10601_022_09338_9 crossref_primary_10_1007_s12532_024_00253_z crossref_primary_10_1007_s10898_022_01252_x crossref_primary_10_1007_s10107_024_02185_x crossref_primary_10_1137_23M156046X crossref_primary_10_1007_s11425_023_2294_3 crossref_primary_10_1016_j_jenvman_2024_123276 crossref_primary_10_2139_ssrn_3793042 crossref_primary_10_1016_j_disopt_2025_100912 crossref_primary_10_1016_j_swevo_2024_101663 crossref_primary_10_1007_s12532_021_00209_7 crossref_primary_10_1016_j_laa_2023_01_013 crossref_primary_10_1109_TCAD_2024_3447473 crossref_primary_10_1007_s12351_023_00777_7 crossref_primary_10_1016_j_disopt_2023_100771 crossref_primary_10_1109_TPAMI_2025_3562286 crossref_primary_10_1002_net_22117 crossref_primary_10_1109_ACCESS_2024_3361323 crossref_primary_10_1007_s12532_022_00232_2 crossref_primary_10_1016_j_cor_2023_106397 crossref_primary_10_1287_ijoc_2022_0060 crossref_primary_10_1007_s12532_024_00269_5 crossref_primary_10_1038_s42256_022_00579_0 crossref_primary_10_1007_s12532_025_00288_w crossref_primary_10_1287_ijoc_2024_0709 crossref_primary_10_1007_s12469_022_00292_6 crossref_primary_10_3390_a18030140 crossref_primary_10_1007_s12532_025_00289_9 crossref_primary_10_1080_01605682_2023_2253852 crossref_primary_10_1287_ijoc_2023_0255 crossref_primary_10_1016_j_ejco_2025_100107 crossref_primary_10_1287_ijoc_2023_0017 crossref_primary_10_1007_s10107_023_01991_z crossref_primary_10_1088_2632_2153_ace0f5 crossref_primary_10_1016_j_orl_2024_107074 crossref_primary_10_1111_itor_13313 crossref_primary_10_3389_fams_2023_1128181 crossref_primary_10_3390_math11132794 crossref_primary_10_1016_j_cor_2022_105916 crossref_primary_10_1287_ijoc_2022_0099 crossref_primary_10_1016_j_ejco_2023_100061 crossref_primary_10_1287_ijoc_2022_0291 crossref_primary_10_1016_j_compchemeng_2024_108688 crossref_primary_10_1016_j_cor_2023_106344 crossref_primary_10_1007_s12532_024_00256_w crossref_primary_10_1016_j_compchemeng_2024_108686 crossref_primary_10_1287_ijoc_2022_0171 crossref_primary_10_1049_ell2_70362 crossref_primary_10_1287_ijoc_2021_0233 crossref_primary_10_1007_s43069_024_00336_6 crossref_primary_10_1016_j_ejor_2023_01_054 crossref_primary_10_1007_s12532_025_00278_y
Cites_doi	10.1007/s12532-015-0083-5 10.1007/s12532-011-0025-9 10.1287/ijoc.15.1.114.15159 10.1016/S0065-2458(08)60520-3 10.1007/978-3-319-89920-6_20 10.1016/j.artint.2016.04.003 10.1287/ijoc.1080.0293 10.1057/jors.1990.166 10.1016/j.cor.2013.11.015 10.1287/ijoc.2018.0857 10.1007/978-3-642-13193-6_21 10.1007/s12532-018-0147-4 10.1007/BF01609036 10.1137/0101002 10.1016/j.cor.2015.04.022 10.2307/2346830 10.1016/j.orl.2005.07.009 10.5281/zenodo.2656800 10.1007/3-540-49257-7_15 10.1287/ijoc.8.1.1 10.1007/BF01588801 10.1045/september95-browne 10.1109/IPDPS.2016.56 10.1287/opre.50.1.3.17780
ContentType	Journal Article
Copyright	The Author(s) 2021 The Author(s) 2021. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml	– notice: The Author(s) 2021 – notice: The Author(s) 2021. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID	C6C AAYXX CITATION JQ2
DOI	10.1007/s12532-020-00194-3
DatabaseName	Springer Nature OA Free Journals CrossRef ProQuest Computer Science Collection
DatabaseTitle	CrossRef ProQuest Computer Science Collection
DatabaseTitleList	CrossRef ProQuest Computer Science Collection
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Mathematics
EISSN	1867-2957
EndPage	490
ExternalDocumentID	10_1007_s12532_020_00194_3
GrantInformation_xml	– fundername: Konrad-Zuse-Zentrum für Informationstechnik (4269)
GroupedDBID	-5D -5G -BR -EM -~C 06D 0R~ 0VY 1N0 203 29M 2JY 2KG 2VQ 2~H 30V 4.4 406 408 409 40D 40E 6NX 8UJ 96X AAAVM AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH AAZMS ABAKF ABBXA ABDZT ABECU ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABMQK ABQBU ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACDTI ACGFS ACHSB ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGNC AEJHL AEJRE AEKMD AEMSY AEOHA AEPYU AESKC AEVLU AEXYK AFBBN AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGJBK AGMZJ AGQEE AGQMX AGRTI AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALFXC ALMA_UNASSIGNED_HOLDINGS AMKLP AMXSW AMYLF AMYQR ANMIH AOCGG ASPBG AUKKA AVWKF AXYYD AYJHY AZFZN BA0 BAPOH BGNMA C6C CAG COF CSCUP DDRTE DNIVK DPUIP EBLON EBS EIOEI EJD ESBYG FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FYJPI GGCAI GGRSB GJIRD GQ6 GQ7 GQ8 GXS H13 HF~ HG6 HLICF HMJXF HQYDN HRMNR HZ~ I0C IJ- IKXTQ IWAJR IXC IXD IZIGR I~X J-C J0Z J9A JBSCW JCJTX JZLTJ KOV LLZTM M4Y NPVJJ NQJWS NU0 O9- O93 O9J OAM OK1 P9R PT4 QOS R89 RIG RLLFE ROL RSV S1Z S27 S3B SDH SHX SISQX SJYHP SMT SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE T13 TSG U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W48 WK8 Z45 Z83 ZMTXR ~A9 AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC AEZWR AFDZB AFHIU AFOHR AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION JQ2
ID	FETCH-LOGICAL-c429t-41312b315fe7f133ed5b6afae9631597f74e66bc6b4865cdaae45a2de7f39b873
IEDL.DBID	RSV
ISICitedReferencesCount	137
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000605920200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1867-2949
IngestDate	Thu Oct 02 15:04:25 EDT 2025 Sat Nov 29 06:19:08 EST 2025 Tue Nov 18 21:53:07 EST 2025 Fri Feb 21 02:47:59 EST 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	3
Keywords	90C10 Mixed integer linear optimization MIP 90C11 90C06 Benchmarking Instance library Selection methodology 90C09
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c429t-41312b315fe7f133ed5b6afae9631597f74e66bc6b4865cdaae45a2de7f39b873
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-3036-7239 0000-0002-4416-925X 0000-0003-0391-5903 0000-0002-2943-7762 0000-0002-0232-2244 0000-0003-4442-3059 0000-0001-7132-5142 0000-0002-4306-9089 0000-0001-6141-5937 0000-0002-1967-0077 0000-0002-2635-0522 0000-0003-1961-657X 0000-0002-6320-8154 0000-0002-2902-882X
OpenAccessLink	https://link.springer.com/10.1007/s12532-020-00194-3
PQID	2562249764
PQPubID	2044128
PageCount	48
ParticipantIDs	proquest_journals_2562249764 crossref_primary_10_1007_s12532_020_00194_3 crossref_citationtrail_10_1007_s12532_020_00194_3 springer_journals_10_1007_s12532_020_00194_3
PublicationCentury	2000
PublicationDate	2021-09-01
PublicationDateYYYYMMDD	2021-09-01
PublicationDate_xml	– month: 09 year: 2021 text: 2021-09-01 day: 01
PublicationDecade	2020
PublicationPlace	Berlin/Heidelberg
PublicationPlace_xml	– name: Berlin/Heidelberg – name: Heidelberg
PublicationSubtitle	A Publication of the Mathematical Optimization Society
PublicationTitle	Mathematical programming computation
PublicationTitleAbbrev	Math. Prog. Comp
PublicationYear	2021
Publisher	Springer Berlin Heidelberg Springer Nature B.V
Publisher_xml	– name: Springer Berlin Heidelberg – name: Springer Nature B.V
References	Beyer, K., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is “nearest neighbor” meaningful? In: C. Beeri, P. Buneman (eds.) Database Theory–ICDT’99, pp. 217–235. Springer, Berlin (1999). https://doi.org/10.1007/3-540-49257-7_15 Galati, M.V.: Decomposition in Integer Programming. Phd, Lehigh University (2009). http://coral.ie.lehigh.edu/~ted/files/papers/MatthewGalatiDissertation09.pdf HookerJNeeded: an empirical science of algorithmsOper. Res.1993422210212 LaundyRPerregaardMTavaresGTipiHVazacopoulosASolving hard mixed integer programming problems with Xpress-MP: A MIPLIB 2003 case studyINFORMS J. Comput.200921304319254912810.1287/ijoc.1080.0293 BixbyRESolving real-world linear programs: a decade and more of progressOper. Res.2002501315188520410.1287/opre.50.1.3.177801163.90643 Hendel, G.: IPET interactive performance evaluation tools. https://github.com/GregorCH/ipet JacksonRHFBoggsPTNashSGPowellSGuidelines for reporting results of computational experiments. Report of the ad hoc committeeMath. Program.199149413425155301010.1007/BF01588801 BixbyRECeriaSMcZealCSavelsberghMAn updated mixed integer programming library: MIPLIB 3.0Optima1998581215 GamrathGKochTMartinAMiltenbergerMWeningerDProgress in presolving for mixed integer programmingMath. Program. Comput.2015342306410.1007/s12532-015-0083-51329.90089 Solving Constraint Integer Programs (2019). http://scip.zib.de Shinano, Y.: The Ubiquity Generator framework: 7 years of progress in parallelizing branch-and-bound. In: N. Kliewer, J.F. Ehmke, R. Borndörfer (eds.) Operations Research Proceedings 2017, pp. 143–149. Springer International Publishing, Cham (2018). https://doi.org/10.1007/978-3-319-89920-6_20 IBM ILOG CPLEX Optimizer (2019). http://www-01.ibm.com/software/integration/optimization/cplex-optimizer MOSEK (2019). https://www.mosek.com BixbyREBoydEAIndovinaRRMIPLIB: a test set of mixed integer programming problemsSIAM News19922516 Georges, A., Gleixner, A., Gojic, G., Gottwald, R.L., Haley, D., Hendel, G., Matejczyk, B.: Feature-based algorithm selection for mixed integer programming. ZIB-Report 18-17, Zuse Institute Berlin (2018) Gamrath, G., Lübbecke, M.: Experiments with a generic Dantzig–Wolfe decomposition for integer programs. In: P. Festa (ed.) Experimental Algorithms, Lect. Notes in Comp. Sci., vol. 6049, pp. 239–252. Springer, Berlin (2010). https://doi.org/10.1007/978-3-642-13193-6_21 Browne, S., Dongarra, J., Grosse, E., Rowan, T.: The Netlib mathematical software repository. D-lib Magazine 1(9), (1995) CrowderHPDemboRSMulveyJMReporting computational experiments in mathematical programmingMath. Program.197815316329155287710.1007/BF01609036 Gleixner, A., Bastubbe, M., Eifler, L., Gally, T., Gamrath, G., Gottwald, R.L., Hendel, G., Hojny, C., Koch, T., Lübbecke, M.E., Maher, S.J., Miltenberger, M., Müller, B., Pfetsch, M.E., Puchert, C., Rehfeldt, D., Schlösser, F., Schubert, C., Serrano, F., Shinano, Y., Viernickel, J.M., Walter, M., Wegscheider, F., Witt, J.T., Witzig, J.: The SCIP Optimization Suite 6.0. ZIB-Report 18–26. Zuse Institute, Berlin (2018) Smith-MilesKBowlySGenerating new test instances by evolving in instance spaceComput. Oper. Res.201563102113336107610.1016/j.cor.2015.04.022 COIN-OR branch-and-cut MIP solver (2019). https://github.com/coin-or/Cbc BeasleyJEOR-Library: distributing test problems by electronic mailJ. Oper. Res. Soc.199041111069107210.1057/jors.1990.166 BussieckMRDrudASMeerausAMINLPLib—a collection of test models for mixed-integer nonlinear programmingINFORMS J. Comput.2003151114119196534610.1287/ijoc.15.1.114.15159 LinderothJTRalphsTKNoncommercial software for mixed-integer linear programmingInteg. Program. Theory Pract.20053253–3031441891137.90622 Galati, M., Ralphs, T., Wang, J.: Computational Experience with Generic Decomposition using the DIP Framework. In: Proceedings of RAMP 2012 (2012). http://coral.ie.lehigh.edu/~ted/files/papers/RAMP12.pdf NazarethJLComputer Solutions of Linear Programs. Monographs on Numerical Analysis1987OxfordOxford University Press BischlBKerschkePKotthoffLLindauerMMalitskyYFréchetteAHoosHHutterFLeyton-BrownKTierneyKASlib: a benchmark library for algorithm selectionArtif. Intell.20162374158350123910.1016/j.artint.2016.04.003 HoffmanAMannosMSokolowskyDWiegmannNComputational experience in solving linear programsJ. Soc. Ind. Appl. Math.19531117335762010.1137/0101002 LodiAJüngerMLieblingTNaddefDNemhauserGPulleyblankWReineltGRinaldiGWolseyLMIP computation50 Years of Integer Programming 1958–20082009BerlinSpringer619645 MathWorks: MATLAB Optimization Toolbox (2019). https://de.mathworks.com/products/optimization.html MIPLIB 2.0. http://miplib2010.zib.de/miplib2/miplib2.html Granlund, T., the GMP development team: GNU MP: The GNU Multiple Precision Arithmetic Library, 6.1.2 edn (2016). http://gmplib.org Achterberg, T.: Constraint integer programming. Ph.D. thesis, Technische Universität Berlin (2007) HartiganJAWongMAAlgorithm AS 136: A K-Means clustering algorithmAppl. Stat.197928110010810.2307/23468300447.62062 Shinano, Y., Achterberg, T., Berthold, T., Heinz, S., Koch, T., Winkler, M.: Solving Open MIP Instances with ParaSCIP on Supercomputers using up to 80,000 Cores. In: Proceedings of the 30th IEEE International Parallel & Distributed Processing Symposium (2016). https://doi.org/10.1109/IPDPS.2016.56 SAS: SAS/OR (2019). https://www.sas.com/en_us/software/or.html FuriniFTraversiEBelottiPFrangioniAGleixnerAGouldNLibertiLLodiAMisenerRMittelmannHQPLIB: a library of quadratic programming instancesMath. Program. Comput.2019112237265394653710.1007/s12532-018-0147-4 Rice, J.R.: The algorithm selection problem. In: Advances in computers, vol. 15, pp. 65–118. Elsevier (1976) AchterbergTKochTMartinAMIPLIB 2003Oper. Res. Lett.2006344361372222521910.1016/j.orl.2005.07.0091133.90300 GUROBI Optimizer (2019). http://www.gurobi.com/products/gurobi-optimizer/gurobi-overview KochTAchterbergTAndersenEBastertOBertholdTBixbyREDannaEGamrathGGleixnerAMHeinzSLodiAMittelmannHRalphsTSalvagninDSteffyDEWolterKMIPLIB 2010Math. Program. Comput.20113103163281188710.1007/s12532-011-0025-9 AchterbergTBixbyREGuZRothbergEWeningerDPresolve reductions in mixed integer programmingINFORMS J. Comput.201910.1287/ijoc.2018.085707290858 Galati, M., Ralphs, T., Wang, J.: DIP/DipPy version 0.92 (2019). https://doi.org/10.5281/zenodo.2656800. http://github.com/coin-or/Dip van der MaatenLHintonGVisualizing high-dimensional data using t-SNEJ. Mach. Learn. Res.20089257926051225.68219 Xpress: FICO Xpress-Optimizer (2019). http://www.fico.com/en/Products/DMTools/xpress-overview/Pages/Xpress-Optimizer.aspx FourerRMGayDWKernighanBAMPL: A Modeling Language for Mathematical Programming2002CaliforniaDuxbury Press0701.90062 IBM Corporation, White Plains, N.Y.: Mathematical Programming System/360 Version 2, Linear and Separable Programming—User’s Manual, 3 edn. (1969). Publication H20–0476–2 Smith-MilesKBaatarDWrefordBLewisRTowards objective measures of algorithm performance across instance spaceComput. Oper. Res.2014451224316124510.1016/j.cor.2013.11.015 McGeochCCToward an experimental method for algorithm simulationINFORMS J. Comput.19968111510.1287/ijoc.8.1.1 McGeochCCExperimental analysis of algorithmsNotices AMS200148330431118200420981.68187 Mittelmann, H.: Benchmarks for optimization software. http://plato.asu.edu/bench.html K Smith-Miles (194_CR49) 2015; 63 A Lodi (194_CR35) 2009 194_CR41 F Furini (194_CR16) 2019; 11 194_CR40 T Koch (194_CR32) 2011; 3 194_CR36 K Smith-Miles (194_CR48) 2014; 45 L van der Maaten (194_CR50) 2008; 9 194_CR39 RM Fourer (194_CR15) 2002 JL Nazareth (194_CR42) 1987 T Achterberg (194_CR2) 2019 A Hoffman (194_CR28) 1953; 1 JE Beasley (194_CR4) 1990; 41 194_CR30 194_CR5 R Laundy (194_CR33) 2009; 21 194_CR23 194_CR1 194_CR22 CC McGeoch (194_CR37) 1996; 8 194_CR21 194_CR27 194_CR25 194_CR24 J Hooker (194_CR29) 1993; 42 RE Bixby (194_CR9) 1998; 58 B Bischl (194_CR6) 2016; 237 JA Hartigan (194_CR26) 1979; 28 194_CR12 194_CR10 194_CR13 RE Bixby (194_CR8) 1992; 25 194_CR19 194_CR18 194_CR17 CC McGeoch (194_CR38) 2001; 48 JT Linderoth (194_CR34) 2005; 3 T Achterberg (194_CR3) 2006; 34 G Gamrath (194_CR20) 2015 RHF Jackson (194_CR31) 1991; 49 194_CR51 194_CR45 HP Crowder (194_CR14) 1978; 15 194_CR44 194_CR43 MR Bussieck (194_CR11) 2003; 15 194_CR47 194_CR46 RE Bixby (194_CR7) 2002; 50
References_xml	– reference: MathWorks: MATLAB Optimization Toolbox (2019). https://de.mathworks.com/products/optimization.html – reference: McGeochCCToward an experimental method for algorithm simulationINFORMS J. Comput.19968111510.1287/ijoc.8.1.1 – reference: Galati, M.V.: Decomposition in Integer Programming. Phd, Lehigh University (2009). http://coral.ie.lehigh.edu/~ted/files/papers/MatthewGalatiDissertation09.pdf – reference: SAS: SAS/OR (2019). https://www.sas.com/en_us/software/or.html – reference: HartiganJAWongMAAlgorithm AS 136: A K-Means clustering algorithmAppl. Stat.197928110010810.2307/23468300447.62062 – reference: HoffmanAMannosMSokolowskyDWiegmannNComputational experience in solving linear programsJ. Soc. Ind. Appl. Math.19531117335762010.1137/0101002 – reference: JacksonRHFBoggsPTNashSGPowellSGuidelines for reporting results of computational experiments. Report of the ad hoc committeeMath. Program.199149413425155301010.1007/BF01588801 – reference: Beyer, K., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is “nearest neighbor” meaningful? In: C. Beeri, P. Buneman (eds.) Database Theory–ICDT’99, pp. 217–235. Springer, Berlin (1999). https://doi.org/10.1007/3-540-49257-7_15 – reference: Smith-MilesKBaatarDWrefordBLewisRTowards objective measures of algorithm performance across instance spaceComput. Oper. Res.2014451224316124510.1016/j.cor.2013.11.015 – reference: Solving Constraint Integer Programs (2019). http://scip.zib.de/ – reference: LaundyRPerregaardMTavaresGTipiHVazacopoulosASolving hard mixed integer programming problems with Xpress-MP: A MIPLIB 2003 case studyINFORMS J. Comput.200921304319254912810.1287/ijoc.1080.0293 – reference: NazarethJLComputer Solutions of Linear Programs. Monographs on Numerical Analysis1987OxfordOxford University Press – reference: AchterbergTBixbyREGuZRothbergEWeningerDPresolve reductions in mixed integer programmingINFORMS J. Comput.201910.1287/ijoc.2018.085707290858 – reference: Mittelmann, H.: Benchmarks for optimization software. http://plato.asu.edu/bench.html – reference: BussieckMRDrudASMeerausAMINLPLib—a collection of test models for mixed-integer nonlinear programmingINFORMS J. Comput.2003151114119196534610.1287/ijoc.15.1.114.15159 – reference: Browne, S., Dongarra, J., Grosse, E., Rowan, T.: The Netlib mathematical software repository. D-lib Magazine 1(9), (1995) – reference: Galati, M., Ralphs, T., Wang, J.: DIP/DipPy version 0.92 (2019). https://doi.org/10.5281/zenodo.2656800. http://github.com/coin-or/Dip – reference: BischlBKerschkePKotthoffLLindauerMMalitskyYFréchetteAHoosHHutterFLeyton-BrownKTierneyKASlib: a benchmark library for algorithm selectionArtif. Intell.20162374158350123910.1016/j.artint.2016.04.003 – reference: HookerJNeeded: an empirical science of algorithmsOper. Res.1993422210212 – reference: LodiAJüngerMLieblingTNaddefDNemhauserGPulleyblankWReineltGRinaldiGWolseyLMIP computation50 Years of Integer Programming 1958–20082009BerlinSpringer619645 – reference: BeasleyJEOR-Library: distributing test problems by electronic mailJ. Oper. Res. Soc.199041111069107210.1057/jors.1990.166 – reference: FuriniFTraversiEBelottiPFrangioniAGleixnerAGouldNLibertiLLodiAMisenerRMittelmannHQPLIB: a library of quadratic programming instancesMath. Program. Comput.2019112237265394653710.1007/s12532-018-0147-4 – reference: FourerRMGayDWKernighanBAMPL: A Modeling Language for Mathematical Programming2002CaliforniaDuxbury Press0701.90062 – reference: AchterbergTKochTMartinAMIPLIB 2003Oper. Res. Lett.2006344361372222521910.1016/j.orl.2005.07.0091133.90300 – reference: KochTAchterbergTAndersenEBastertOBertholdTBixbyREDannaEGamrathGGleixnerAMHeinzSLodiAMittelmannHRalphsTSalvagninDSteffyDEWolterKMIPLIB 2010Math. Program. Comput.20113103163281188710.1007/s12532-011-0025-9 – reference: Gamrath, G., Lübbecke, M.: Experiments with a generic Dantzig–Wolfe decomposition for integer programs. In: P. Festa (ed.) Experimental Algorithms, Lect. Notes in Comp. Sci., vol. 6049, pp. 239–252. Springer, Berlin (2010). https://doi.org/10.1007/978-3-642-13193-6_21 – reference: COIN-OR branch-and-cut MIP solver (2019). https://github.com/coin-or/Cbc – reference: MOSEK (2019). https://www.mosek.com/ – reference: Xpress: FICO Xpress-Optimizer (2019). http://www.fico.com/en/Products/DMTools/xpress-overview/Pages/Xpress-Optimizer.aspx – reference: IBM ILOG CPLEX Optimizer (2019). http://www-01.ibm.com/software/integration/optimization/cplex-optimizer/ – reference: CrowderHPDemboRSMulveyJMReporting computational experiments in mathematical programmingMath. Program.197815316329155287710.1007/BF01609036 – reference: Georges, A., Gleixner, A., Gojic, G., Gottwald, R.L., Haley, D., Hendel, G., Matejczyk, B.: Feature-based algorithm selection for mixed integer programming. ZIB-Report 18-17, Zuse Institute Berlin (2018) – reference: McGeochCCExperimental analysis of algorithmsNotices AMS200148330431118200420981.68187 – reference: BixbyREBoydEAIndovinaRRMIPLIB: a test set of mixed integer programming problemsSIAM News19922516 – reference: Shinano, Y.: The Ubiquity Generator framework: 7 years of progress in parallelizing branch-and-bound. In: N. Kliewer, J.F. Ehmke, R. Borndörfer (eds.) Operations Research Proceedings 2017, pp. 143–149. Springer International Publishing, Cham (2018). https://doi.org/10.1007/978-3-319-89920-6_20 – reference: BixbyRESolving real-world linear programs: a decade and more of progressOper. Res.2002501315188520410.1287/opre.50.1.3.177801163.90643 – reference: Achterberg, T.: Constraint integer programming. Ph.D. thesis, Technische Universität Berlin (2007) – reference: MIPLIB 2.0. http://miplib2010.zib.de/miplib2/miplib2.html – reference: BixbyRECeriaSMcZealCSavelsberghMAn updated mixed integer programming library: MIPLIB 3.0Optima1998581215 – reference: IBM Corporation, White Plains, N.Y.: Mathematical Programming System/360 Version 2, Linear and Separable Programming—User’s Manual, 3 edn. (1969). Publication H20–0476–2 – reference: Granlund, T., the GMP development team: GNU MP: The GNU Multiple Precision Arithmetic Library, 6.1.2 edn (2016). http://gmplib.org/ – reference: Smith-MilesKBowlySGenerating new test instances by evolving in instance spaceComput. Oper. Res.201563102113336107610.1016/j.cor.2015.04.022 – reference: Rice, J.R.: The algorithm selection problem. In: Advances in computers, vol. 15, pp. 65–118. Elsevier (1976) – reference: Shinano, Y., Achterberg, T., Berthold, T., Heinz, S., Koch, T., Winkler, M.: Solving Open MIP Instances with ParaSCIP on Supercomputers using up to 80,000 Cores. In: Proceedings of the 30th IEEE International Parallel & Distributed Processing Symposium (2016). https://doi.org/10.1109/IPDPS.2016.56 – reference: LinderothJTRalphsTKNoncommercial software for mixed-integer linear programmingInteg. Program. Theory Pract.20053253–3031441891137.90622 – reference: GUROBI Optimizer (2019). http://www.gurobi.com/products/gurobi-optimizer/gurobi-overview – reference: GamrathGKochTMartinAMiltenbergerMWeningerDProgress in presolving for mixed integer programmingMath. Program. Comput.2015342306410.1007/s12532-015-0083-51329.90089 – reference: Galati, M., Ralphs, T., Wang, J.: Computational Experience with Generic Decomposition using the DIP Framework. In: Proceedings of RAMP 2012 (2012). http://coral.ie.lehigh.edu/~ted/files/papers/RAMP12.pdf – reference: Hendel, G.: IPET interactive performance evaluation tools. https://github.com/GregorCH/ipet – reference: van der MaatenLHintonGVisualizing high-dimensional data using t-SNEJ. Mach. Learn. Res.20089257926051225.68219 – reference: Gleixner, A., Bastubbe, M., Eifler, L., Gally, T., Gamrath, G., Gottwald, R.L., Hendel, G., Hojny, C., Koch, T., Lübbecke, M.E., Maher, S.J., Miltenberger, M., Müller, B., Pfetsch, M.E., Puchert, C., Rehfeldt, D., Schlösser, F., Schubert, C., Serrano, F., Shinano, Y., Viernickel, J.M., Walter, M., Wegscheider, F., Witt, J.T., Witzig, J.: The SCIP Optimization Suite 6.0. ZIB-Report 18–26. Zuse Institute, Berlin (2018) – ident: 194_CR24 – year: 2015 ident: 194_CR20 publication-title: Math. Program. Comput. doi: 10.1007/s12532-015-0083-5 – volume: 3 start-page: 103 year: 2011 ident: 194_CR32 publication-title: Math. Program. Comput. doi: 10.1007/s12532-011-0025-9 – volume-title: Computer Solutions of Linear Programs. Monographs on Numerical Analysis year: 1987 ident: 194_CR42 – volume: 15 start-page: 114 issue: 1 year: 2003 ident: 194_CR11 publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.15.1.114.15159 – volume-title: AMPL: A Modeling Language for Mathematical Programming year: 2002 ident: 194_CR15 – ident: 194_CR30 – ident: 194_CR43 doi: 10.1016/S0065-2458(08)60520-3 – ident: 194_CR46 doi: 10.1007/978-3-319-89920-6_20 – volume: 237 start-page: 41 year: 2016 ident: 194_CR6 publication-title: Artif. Intell. doi: 10.1016/j.artint.2016.04.003 – ident: 194_CR19 – ident: 194_CR25 – volume: 21 start-page: 304 year: 2009 ident: 194_CR33 publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.1080.0293 – volume: 41 start-page: 1069 issue: 11 year: 1990 ident: 194_CR4 publication-title: J. Oper. Res. Soc. doi: 10.1057/jors.1990.166 – volume: 9 start-page: 2579 year: 2008 ident: 194_CR50 publication-title: J. Mach. Learn. Res. – volume: 45 start-page: 12 year: 2014 ident: 194_CR48 publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2013.11.015 – year: 2019 ident: 194_CR2 publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.2018.0857 – ident: 194_CR21 doi: 10.1007/978-3-642-13193-6_21 – ident: 194_CR39 – volume: 11 start-page: 237 issue: 2 year: 2019 ident: 194_CR16 publication-title: Math. Program. Comput. doi: 10.1007/s12532-018-0147-4 – volume: 15 start-page: 316 year: 1978 ident: 194_CR14 publication-title: Math. Program. doi: 10.1007/BF01609036 – ident: 194_CR22 – volume: 1 start-page: 17 issue: 1 year: 1953 ident: 194_CR28 publication-title: J. Soc. Ind. Appl. Math. doi: 10.1137/0101002 – ident: 194_CR41 – volume: 63 start-page: 102 year: 2015 ident: 194_CR49 publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2015.04.022 – volume: 28 start-page: 100 issue: 1 year: 1979 ident: 194_CR26 publication-title: Appl. Stat. doi: 10.2307/2346830 – ident: 194_CR45 – volume: 34 start-page: 361 issue: 4 year: 2006 ident: 194_CR3 publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2005.07.009 – ident: 194_CR18 doi: 10.5281/zenodo.2656800 – volume: 48 start-page: 304 issue: 3 year: 2001 ident: 194_CR38 publication-title: Notices AMS – ident: 194_CR13 – ident: 194_CR5 doi: 10.1007/3-540-49257-7_15 – volume: 25 start-page: 16 year: 1992 ident: 194_CR8 publication-title: SIAM News – ident: 194_CR17 – volume: 42 start-page: 210 issue: 2 year: 1993 ident: 194_CR29 publication-title: Oper. Res. – volume: 8 start-page: 1 issue: 1 year: 1996 ident: 194_CR37 publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.8.1.1 – volume: 49 start-page: 413 year: 1991 ident: 194_CR31 publication-title: Math. Program. doi: 10.1007/BF01588801 – volume: 3 start-page: 144 issue: 253–303 year: 2005 ident: 194_CR34 publication-title: Integ. Program. Theory Pract. – ident: 194_CR51 – ident: 194_CR10 doi: 10.1045/september95-browne – ident: 194_CR36 – ident: 194_CR23 – start-page: 619 volume-title: 50 Years of Integer Programming 1958–2008 year: 2009 ident: 194_CR35 – ident: 194_CR1 – ident: 194_CR27 – ident: 194_CR40 – ident: 194_CR44 – ident: 194_CR12 – volume: 58 start-page: 12 year: 1998 ident: 194_CR9 publication-title: Optima – ident: 194_CR47 doi: 10.1109/IPDPS.2016.56 – volume: 50 start-page: 3 issue: 1 year: 2002 ident: 194_CR7 publication-title: Oper. Res. doi: 10.1287/opre.50.1.3.17780
SSID	ssj0000327839
Score	2.6355166
Snippet	We report on the selection process leading to the sixth version of the Mixed Integer Programming Library, MIPLIB 2017. Selected from an initial pool of 5721...
SourceID	proquest crossref springer
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	443
SubjectTerms	Full Length Paper Integer programming Libraries Mathematics Mathematics and Statistics Mathematics of Computing Mixed integer Operations Research/Decision Theory Optimization Theory of Computation
Title	MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
URI	https://link.springer.com/article/10.1007/s12532-020-00194-3 https://www.proquest.com/docview/2562249764
Volume	13
WOSCitedRecordID	wos000605920200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1867-2957 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000327839 issn: 1867-2949 databaseCode: RSV dateStart: 20090701 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1bS8MwFA46fdAH7-J0Sh5808DSJM3qm4rDgRtjXthbSdMEB26Tdoo_x9_iL_Oka1cVFfSxNDm0J5fzJfnyHYQOTd1yJwRGjNUB4ZoLEmipiBBSUWOpY9tkySZkp9Po94NufiksLdjuxZFkNlOXl908wTziljsOl3DC5tEChLuGS9jQu76b7azUmcse4XCvE2sjXsCD_LbM92Y-R6QSZn45Gc0CTnP1f5-6hlZygIlPpz1iHc2Z0QZa_iA7CE_tmVZruol67Vb3qnWGIUbLE-wYoyRO3ByIHd18MOXK4bHFUAf7k_u31-HgxcQkE5owCc4ZXkMwjfM9oS1027y4Ob8keaYFoiEeTQhEMupFjAprpIVVq4lF5CurDAxPwDvSSm58P9J-xBu-0LFShgvlxVCaBVFDsm1UGY1HZgfhwAAgNNQK9-O0rhQHjCJiTzNKpWKyimjh7VDnMuQuG8ZDWAooO--F4L0w817IquhoVudxKsLxa-la0YhhPiDTEJAdgBXAXryKjotGK1__bG33b8X30JLnWC8ZC62GKpPkyeyjRf08GaTJQdZR3wHXNN6s
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1bS8MwFD7oFNQH7-J0ah5808DSJM3qm4ricBviDd9KmiY40CnbFH-Ov8Vf5knXbioq6GNpcmhPLudL8uU7ANu26oQXAqPWmYgKIySNjNJUSqWZdcyzbbJkE6rVqt3cRGf5pbBewXYvjiSzmXp02S2QPKB-ueNxiaB8HCYERiyvmH9-cT3cWalynz3C414v1kaDSET5bZnvzXyOSCOY-eVkNAs4x3P_-9R5mM0BJtkf9IgFGLOdRZj5IDuIT82hVmtvCc6b9bNG_YBgjFZ7xDNGadr1cyDxdPP2gCtHHhzBOiTs37693rdfbEozoQnbJTnD6x5Nk3xPaBmujo8uD09onmmBGoxHfYqRjAUJZ9JZ5XDValOZhNppi8MT8Y5yStgwTEyYiFooTaq1FVIHKZbmUVJTfAVKnYeOXQUSWQSEljnpf5xVtRaIUWQaGM6Y0lyVgRXejk0uQ-6zYdzFIwFl770YvRdn3ot5GXaGdR4HIhy_lq4UjRjnA7IXI7JDsILYS5Rht2i00eufra39rfgWTJ1cNhtxo946XYfpwDNgMkZaBUr97pPdgEnz3G_3uptZp30HT7ThkA
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3JTsMwEB2xCcGBHVFWH7iBRR3bccONraICqopN3CLHsUUlKKgNiM_hW_gyPGnaAgIkxDHyomRsZ57tN28ANm3ZCRQCo9aZiAojJI2M0lRKpZl1DNk2ebIJVa9Xbm6ixoco_pzt3ruS7MY0oEpTK9t5TN3OIPAtkDyguPVBjCIoH4ZRgUR63K9fXPdPWcocM0kgBkbhNhpEIioiZ77v5rN3GkDOL7ekufOpTv__tWdgqgCeZK87U2ZhyLbmYPKDHKF_OutruHbm4fys1jit7RPvu9UuQSYpTdv4byRIQ292OXTkwRHfhoTZ7dvrffPFpjQXoLBtUjC_7n3XpDgrWoCr6tHlwTEtMjBQ4_1URr2HY0HCmXRWOb-btalMQu209cvW4yDllLBhmJgwEZVQmlRrK6QOUl-bR0lF8UUYaT207BKQyHqgaJmT-OGsrLXw2EWmgeGMKc1VCVjP8rEp5MkxS8ZdPBBWRuvF3npxbr2Yl2Cr3-axK87xa-3V3oDGxULtxB7xeRDjMZkowXZvAAfFP_e2_LfqGzDeOKzGp7X6yQpMBEiMyYlqqzCStZ_sGoyZ56zZaa_n8_cdMDzqdA
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=MIPLIB+2017%3A+data-driven+compilation+of+the+6th%C2%A0mixed-integer+programming+library&rft.jtitle=Mathematical+programming+computation&rft.au=Gleixner%2C+Ambros&rft.au=Hendel%2C+Gregor&rft.au=Gamrath%2C+Gerald&rft.au=Achterberg%2C+Tobias&rft.date=2021-09-01&rft.pub=Springer+Berlin+Heidelberg&rft.issn=1867-2949&rft.eissn=1867-2957&rft.volume=13&rft.issue=3&rft.spage=443&rft.epage=490&rft_id=info:doi/10.1007%2Fs12532-020-00194-3&rft.externalDocID=10_1007_s12532_020_00194_3
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1867-2949&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1867-2949&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1867-2949&client=summon