MIPLIB 2003

Authors:
Tobias Achterberg;Thorsten Koch;Alexander Martin
Affiliations:
Zuse Institute Berlin, Takustrasse 7, Berlin, Germany;Zuse Institute Berlin, Takustrasse 7, Berlin, Germany;Technische Universtität Darmstadt, Germany
Venue:
Operations Research Letters
Year:
2006

Citing 3
Cited 36

A Branch-and-Cut Approach for Solving Railway Line-Planning Problems

Transportation Science
A General Heuristic for Production Planning Problems

INFORMS Journal on Computing
The final NETLIB-LP results

Operations Research Letters

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

INFORMS Journal on Computing
Backdoors to Combinatorial Optimization: Feasibility and Optimality

CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Grid-Enabled Optimization with GAMS

INFORMS Journal on Computing
Computational Experience with a Software Framework for Parallel Integer Programming

INFORMS Journal on Computing
Pruning Moves

INFORMS Journal on Computing
Faster MIP solutions via new node selection rules

Computers and Operations Research
Constraint integer programming: a new approach to integrate CP and MIP

CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Computing with multi-row gomory cuts

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
ZI round, a MIP rounding heuristic

Journal of Heuristics
Solving Very Sparse Rational Systems of Equations

ACM Transactions on Mathematical Software (TOMS)
How much do we "pay" for using default parameters?

Computational Optimization and Applications
Partial convexification of general MIPs by Dantzig-Wolfe reformulation

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Predicting the Solution Time of Branch-and-Bound Algorithms for Mixed-Integer Programs

INFORMS Journal on Computing
Lifted Tableaux Inequalities for 0--1 Mixed-Integer Programs: A Computational Study

INFORMS Journal on Computing
Cutting to the Chase solving linear integer arithmetic

CADE'11 Proceedings of the 23rd international conference on Automated deduction
Heuristic algorithms for the inverse mixed integer linear programming problem

Journal of Global Optimization
Optimizing over the first chvàtal closure

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Boolean lexicographic optimization: algorithms & applications

Annals of Mathematics and Artificial Intelligence
Rapid learning for binary programs

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A relax-and-cut framework for gomory's mixed-integer cuts

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
An in-out approach to disjunctive optimization

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Zero-Coefficient cuts

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Experiments with two row tableau cuts

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Computing with multi-row Gomory cuts

Operations Research Letters
Cutting plane algorithms for the inverse mixed integer linear programming problem

Operations Research Letters
Conflict analysis in mixed integer programming

Discrete Optimization
Improving the feasibility pump

Discrete Optimization
A simplex-based extension of fourier-motzkin for solving linear integer arithmetic

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
ParaLEX: a parallel extension for the CPLEX mixed integer optimizer

PVM/MPI'07 Proceedings of the 14th European conference on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem

Journal of Global Optimization
A New Local Search Algorithm for Binary Optimization

INFORMS Journal on Computing
Valid Linear Programming Bounds for Exact Mixed-Integer Programming

INFORMS Journal on Computing
Combining Lift-and-Project and Reduce-and-Split

INFORMS Journal on Computing
Backdoor Branching

INFORMS Journal on Computing
Approximating the Split Closure

INFORMS Journal on Computing
Feasibility Pump-like heuristics for mixed integer problems

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper reports on the fourth version of the Mixed Integer Programming Library. Since MIPLIB is to provide a concise set of challenging problems, it became necessary to purge instances that became too easy. We present an overview of the 27 new problems and statistical data for all 60 instances.