Filters








181 Hits in 0.9 sec

Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study

Richard Laundy, Michael Perregaard, Gabriel Tavares, Horia Tipi, Alkis Vazacopoulos
2009 INFORMS journal on computing  
In this paper we take a closer look at some of the hardest problems in the MIPLIB 2003 library ([4]) to show how much progress has been made with Xpress-MP.  ...  MIPLIB 2003 MIPLIB 2003 is a standard and widely used benchmark to compare the performance of various MIP algorithms (e.g., [2, 3, 7, 10, 11, 12, 15, 16, 19, 20, 21, 22, 23, 24, 25, 27, 35] ).  ...  Table 3 : 3 Comparative performance of the Xpress software releases between 2003 and 2006 in the MIPLIB 2003 easier instances.  ... 
doi:10.1287/ijoc.1080.0293 fatcat:npiwf3ytnzgojomz4fblczxdry

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).  ...  This fi gure presents the number of instances of MIPLIB 2003 library in three categories -easy, hard and not solved -within 8 years from 2003.  ...  Information about benchmarks with the previous version of the MIPLIB library (MIPLIB 2003) is presented in Jablonský (2008) . Tab.  ... 
doi:10.11118/201563061923 fatcat:shniyusivvgzbedrysokyafi6e

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.  ...  Further, we use our heuristic to generate globally valid rank-1 GMI cuts at nodes of a branch-and-cut tree and use these cuts to solve a difficult problem from MIPLIB 2003, namely timtab2, without using  ...  17 out of 20 problems in MIPLIB 2003.  ... 
doi:10.1007/s12532-010-0018-0 fatcat:6upjxrnvknczxawy7n7dbppboy

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).  ...  This fi gure presents the number of instances of MIPLIB 2003 library in three categories -easy, hard and not solved -within 8 years from 2003.  ...  Information about benchmarks with the previous version of the MIPLIB library (MIPLIB 2003) is presented in Jablonský (2008) . Tab.  ... 
doi:10.11118/actaun201563061923 fatcat:bhmhganpxnbrxd3vnqqxzqhtta

On optimizing over lift-and-project closures

Pierre Bonami
2012 Mathematical Programming Computation  
on MIPLIB 2003.  ...  Computation of Pe and P e * We ran our code to compute Pe and P e * on 62 MIPLIB 3.0 instances 1 and 20 MIPLIB 2003 instances that are not already in MIPLIB 3.0.  ... 
doi:10.1007/s12532-012-0037-0 fatcat:435hpltrhvfw7bmpvrtdfka26y

Improving strong branching by domain propagation

Gerald Gamrath
2014 EURO Journal on Computational Optimization  
2003), full strong branching, optimum value provided, solved after 81 nodes Let's add some more things: additional statistics: implications, cutoffs, conflicts Further Improvements Let's add  ...  Mittelmann on MIPLIB2010 (January 2013) Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 6 / 19 Computational Experiment: Single Calls 168 instances (MIPLIB  ... 
doi:10.1007/s13675-014-0021-8 fatcat:oyugpeyquzdsporla7uzlztjqy

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.  ...  2017) and ds, timtab2, swath, mkc, t1717, liu, stp3d, dano3mip, momentum3 (from miplib 2003).  ... 
doi:10.1016/j.ejco.2022.100031 fatcat:ycvwq64o2rgs3i2zjr6i2o4bom

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

Pierre Bonami
2010 arXiv   pre-print
on MIPLIB 2003.  ...  All experiments are performed on MIPLIB3 [15] and MIPLIB 2003 [37] problems.  ... 
arXiv:1010.5412v2 fatcat:b474akq77vep3bvodgpxwfdmtu

A relax-and-cut framework for Gomory mixed-integer cuts

Matteo Fischetti, Domenico Salvagnin
2011 Mathematical Programming Computation  
In the end, we were left with 54 instances from MIPLIB 3.0, and 20 instances from MIPLIB 2003.  ...  Computational results We tested our variants of the relax-and-cut framework for GMICs on the problem instances in MIPLIB 3.0 [9] and MIPLIB 2003 [2] .  ... 
doi:10.1007/s12532-011-0024-x fatcat:pc2epekcrzafnl6aao3td2sgqe

Approximating the Split Closure

Matteo Fischetti, Domenico Salvagnin
2013 INFORMS journal on computing  
3.0 and by 2 − 3% on MIPLIB 2003.  ...  3.0 testbed, and 55.2% in 110.09 seconds on the MIPLIB 2003.  ... 
doi:10.1287/ijoc.1120.0543 fatcat:risa4csyojhetj7bzwq6yciih4

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.  ...  This avoids the situation of MIPLIB 2003, for which four instances still remain unsolved 15 years after the release of the test set.  ... 
doi:10.1007/s12532-020-00194-3 fatcat:btzgkrsmpvao7l4m4ydlwbzvru

On the strength of Gomory mixed-integer cuts as group cuts

Sanjeeb Dash, Oktay Günlük
2007 Mathematical programming  
To avoid repetition, we only report on the 27 problems in MIPLIB 2003 which are not part of MIPLIB 3.0 and on the 30 Unibo instances which are not part of MIPLIB 2003.  ...  Miplib 2003 Instances In Table 5 , we present results on the 27 problems in MIPLIB2003 which are not contained in MIPLIB 3.0.  ... 
doi:10.1007/s10107-007-0179-4 fatcat:x7grbjlyuzgztordwoimo2m6ki

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

Numerically Safe Gomory Mixed-Integer Cuts

William Cook, Sanjeeb Dash, Ricardo Fukasawa, Marcos Goycoolea
2009 INFORMS journal on computing  
We report on tests with the MIPLIB 3.0 and MIPLIB 2003 test collections as well as with MIP instances derived from the TSPLIB traveling salesman library.  ...  MIPLIB 3.0 collection (Bixby et al. 1998 ). • The 27 instances in the MIPLIB 2003 collection (Achterberg et al. 2006 ) that are not included in MIPLIB 3.0. • The 13 TSPLIB-MIP instances described in  ...  We report on computational studies with the MIPLIB 3.0 and MIPLIB 2003 test collections (Bixby et al. 1998 , Achterberg et al. 2006 and with MIP instances derived from the TSPLIB traveling salesman library  ... 
doi:10.1287/ijoc.1090.0324 fatcat:wsol7jlsjvbadfe6qekxt5jcsa
« Previous Showing results 1 — 15 out of 181 results