Filters








190 Hits in 0.83 sec

MIPLIBing: Seamless Benchmarking of Mathematical Optimization Problems and Metadata Extensions

Thiago Serra, Ryan J. O'Neil
2020 SN Operations Research Forum  
In particular, we present MIPLIBing: a Python library that automatically downloads queried subsets from the current versions of MIPLIB, MINLPLib, and QPLIB, provides a centralized local cache across projects  ...  Public libraries of problems such as Mixed Integer Programming Library (MIPLIB) are fundamental to creating a common benchmark for measuring algorithmic advances across mathematical optimization solvers  ...  We also thank Mihai Banciu for feedback and suggestions on MIPLIBing.  ... 
doi:10.1007/s43069-020-00024-1 fatcat:63wsovz5hjbttmetajihqibkam

Benchmarks for Current Linear and Mixed Integer Optimization Solvers

Josef Jablonský
2015 Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis  
The solvers are tested on the set of selected problems from MIPLIB 2010 library that contains 361 test instances of diff erent hardness (easy, hard, and not solved).  ...  For the test purposes MIPLIB 2010 library that contains 361 MILP test instances was used.  ...  The selected results for MIPLIB 2010 library are available e.g. in Mittelmann (2015) .  ... 
doi:10.11118/201563061923 fatcat:shniyusivvgzbedrysokyafi6e

Benchmarks for Current Linear and Mixed Integer Optimization Solvers

Josef Jablonský
2015 Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis  
The solvers are tested on the set of selected problems from MIPLIB 2010 library that contains 361 test instances of diff erent hardness (easy, hard, and not solved).  ...  For the test purposes MIPLIB 2010 library that contains 361 MILP test instances was used.  ...  The selected results for MIPLIB 2010 library are available e.g. in Mittelmann (2015) .  ... 
doi:10.11118/actaun201563061923 fatcat:bhmhganpxnbrxd3vnqqxzqhtta

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

Ambros Gleixner, Gregor Hendel, Gerald Gamrath, Tobias Achterberg, Michael Bastubbe, Timo Berthold, Philipp Christophel, Kati Jarck, Thorsten Koch, Jeff Linderoth, Marco Lübbecke, Hans D. Mittelmann (+4 others)
2021 Mathematical Programming Computation  
AbstractWe 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.  ...  since MIPLIB 2010.  ... 
doi:10.1007/s12532-020-00194-3 fatcat:btzgkrsmpvao7l4m4ydlwbzvru

MemComputing Integer Linear Programming [article]

Fabio L. Traversa, Massimiliano Di Ventra
2018 arXiv   pre-print
2010 library.  ...  In particular, we find within minutes feasible solutions for one of these hard problems (f2000 from MIPLIB 2010) whose feasibility, to the best of our knowledge, has remained unknown for the past eight  ...  NUMERICAL RESULTS We consider as benchmark instances, problems from the MIPLIB 2010 library [25] .  ... 
arXiv:1808.09999v1 fatcat:lojxjw4lqrc4hgehugvc7nt6mu

Progress in mathematical programming solvers from 2001 to 2020

Thorsten Koch, Timo Berthold, Jaap Pedersen, Charlie Vanaret
2022 EURO Journal on Computational Optimization  
, namely miplib 2017, miplib 2010, and miplib 2003.  ...  There has been considerable tuning on the miplib instances, especially on miplib 2010 and miplib 2017.  ... 
doi:10.1016/j.ejco.2022.100031 fatcat:ycvwq64o2rgs3i2zjr6i2o4bom

Improving strong branching by domain propagation

Gerald Gamrath
2014 EURO Journal on Computational Optimization  
3, 2003, 2010 benchmark) time limit: 2 hours original + 3 random permutations to reduce performance variability arithmetic mean of solving time and node number per instance instances solved iff all  ...  3, 2003, 2010 benchmark) time limit: 2 hours original + 3 −100 −50 0 50 100 instance % change in #nodes 802% 643% shifted geometric mean reduced by 7% 40 60 80 100 120 1800  ... 
doi:10.1007/s13675-014-0021-8 fatcat:oyugpeyquzdsporla7uzlztjqy

Approximating the Split Closure

Matteo Fischetti, Domenico Salvagnin
2013 INFORMS journal on computing  
MIPLIB 3.0 MIPLIB 2003 method CPU cl.gap time (s) cl.gap time (s) L&P in Bonami (2010) Intel 2.93 GHz 64.4% 2.25 44.4% 121.53 L&P (our) Intel 2.66 GHz 65.3% 2.00 44.8% 87.13 Table 3 :  ...  3.0 and by 2 − 3% on MIPLIB 2003.  ... 
doi:10.1287/ijoc.1120.0543 fatcat:risa4csyojhetj7bzwq6yciih4

A heuristic to generate rank-1 GMI cuts

Sanjeeb Dash, Marcos Goycoolea
2010 Mathematical Programming Computation  
We demonstrate that for problems in MIPLIB 3.0 and MIPLIB 2003, the cuts we generate form an important subclass of all rank-1 mixed-integer rounding cuts.  ...  We give positive answers to these questions for MIPLIB 3.0 problems via a fast heuristic to find rank-1 GMI cuts.  ...  We are left with 20 instances from MIPLIB 2003 not contained in MIPLIB 3.0.  ... 
doi:10.1007/s12532-010-0018-0 fatcat:6upjxrnvknczxawy7n7dbppboy

Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies [article]

Giulia Zarpellon, Jason Jo, Andrea Lodi, Yoshua Bengio
2021 arXiv   pre-print
164547 146 -0 -164401 328818 test MIPLIB 2010 mine-166-5 830 830 -0 -0 8429 test MIPLIB 2010 neos11 1220 900 -0 -320 2706 test MILPLib neos18 3312 3312 -0 -0 11402 test MIPLIB 2010  ...  814 748 -0 -66 1491 train MILPLib pp08aCUTS 240 64 -0 -176 246 train MIPLIB 3 rmatr100-p10 7359 100 -0 -7259 7260 train MIPLIB 2010 rmatr100-p5 8784 100 -0 -8684 8685 train MIPLIB 2010  ... 
arXiv:2002.05120v4 fatcat:szcshfeysjcvjhm6kbx6t4nw2u

Improving Strong Branching by Propagation [chapter]

Gerald Gamrath
2013 Lecture Notes in Computer Science  
As test set, we used the MMM test set consisting of all instances from MIPLIB 3 [25] , MIPLIB 2003 [26] , and the benchmark set of MIPLIB 2010 [27] .  ...  For each if the instances from MIPLIB 3, MIPLIB 2003, and MIPLIB 2010, we list the solving time (where 7200 means that the time limit was reached), the number of processed branch-andbound nodes, and the  ... 
doi:10.1007/978-3-642-38171-3_25 fatcat:id4gc7glfne4ndtjknk52bdp74

A computational comparison of symmetry handling methods for mixed integer programs

Marc E. Pfetsch, Thomas Rehn
2018 Mathematical Programming Computation  
We start by investigating the computation of symmetries and analyze the symmetries present in the MIPLIB 2010 instances.  ...  We present implementations of several techniques available Date: November 2015. 2010 Mathematics Subject Classi cation. 90C11,90C57.  ...  MIPLIB 2010 We next report on the symmetries present in the MIPLIB 2010 [24] instances.  ... 
doi:10.1007/s12532-018-0140-y fatcat:wlqlkurbd5bf3kbbe77r6byqly

On the enumerative nature of Gomory's dual cutting plane method

Egon Balas, Matteo Fischetti, Arrigo Zanette
2010 Mathematical programming  
773751.06 788263 1.84 MIPLIB protfold 2112 1835 -41.96 -31 35.35 MIPLIB 3.0 sentoy 30 60 -7839.28 -7772 0.87 MIPLIB seymour 4944 1372 403.85 423 4.53 MIPLIB 3.0 stein15 35 15  ...  -13164 1.01 MIPLIB 3.0 mitre 2054 9958 114740.52 115155 0.36 MIPLIB 3.0 mzzv11 9499 10240 -22945.24 -21718 5.65 MIPLIB 3.0 mzzv42z 10460 11717 -21623 -20540 5.27 MIPLIB 3.0 p0033  ... 
doi:10.1007/s10107-010-0392-4 fatcat:ltderq5nxffojf2cbpa6xqmfue

On optimizing over lift-and-project closures [article]

Pierre Bonami
2010 arXiv   pre-print
on MIPLIB 2003.  ...  The test instances we consider are a subset of MIPLIB 3.0 and the MIPLIB 2003 that were used in [25, 31] (split closure computations are only available for MIPLIB 3.0).  ... 
arXiv:1010.5412v2 fatcat:b474akq77vep3bvodgpxwfdmtu

A Local Search Approach for Binary Programming: Feasibility Search [chapter]

Samuel Souza Brito, Haroldo Gambini Santos, Bruno Henrique Miranda Santos
2014 Lecture Notes in Computer Science  
Computational experiments comparing with two open source integer programming solvers, CBC and GLPK, in MIPLIB 2010 instances, showed that our approach is more reliable for the production of feasible solutions  ...  In its latest version, LocalSolver reaches better solutions than Gurobi and CPLEX solvers in some MIPLIB 2010 instances classified as hard.  ...  Experiments with binary problems of the Mixed Integer Programming Library (MIPLIB) 2010 show that the proposed approach is able to produce more feasible solutions than the GNU Linear Program Kit (GLPK)  ... 
doi:10.1007/978-3-319-07644-7_4 fatcat:ipxrzgpk2rawpkwhxn7hpslf2a
« Previous Showing results 1 — 15 out of 190 results