Submitter | Variables | Constraints | Density | Status | Group | Objective | MPS File |
---|---|---|---|---|---|---|---|
Gleb Belov | 172013 | 173603 | 1.36235e-05 | hard | radiation | 155328 | radiationm40-10-02.mps.gz |
Linearized Constraint Programming models of the MiniZinc Challenges 2012-2016. I should be able to produce versions with indicator constraints supported by Gurobi and CPLEX, however don’t know if you can use them and if there is a standard format. These MPS were produced by Gurobi 7.0.2 using the MiniZinc develop branch on eb536656062ca13325a96b5d0881742c7d0e3c38
Detailed explanation of the following tables can be found here.
Original | Presolved | |
---|---|---|
Variables | 172013 | 153623 |
Constraints | 173603 | 155243 |
Binaries | 62400 | 68580 |
Integers | 47213 | 27743 |
Continuous | 62400 | 57300 |
Implicit Integers | 0 | 139 |
Fixed Variables | 0 | 0 |
Nonzero Density | 1.36235e-05 | 1.45291e-05 |
Nonzeroes | 406825 | 346502 |
Original | Presolved | |
---|---|---|
Total | 173603 | 156393 |
Empty | 0 | 0 |
Free | 0 | 0 |
Singleton | 0 | 0 |
Aggregations | 109200 | 109963 |
Precedence | 15600 | 7802 |
Variable Bound | 15600 | 20555 |
Set Partitioning | 0 | 0 |
Set Packing | 0 | 0 |
Set Covering | 0 | 0 |
Cardinality | 0 | 0 |
Invariant Knapsack | 0 | 0 |
Equation Knapsack | 0 | 0 |
Bin Packing | 0 | 0 |
Knapsack | 0 | 0 |
Integer Knapsack | 0 | 1150 |
Mixed Binary | 15600 | 10587 |
General Linear | 17603 | 6336 |
Indicator | 0 | 0 |
Available nonzero structure and decomposition information. Further information can be found here.
Decomposed structure of original problem (dec-file)
Decomposed structure after trivial presolving (dec-file)
value | min | median | mean | max | |
---|---|---|---|---|---|
Components | 4.154120 | ||||
Constraint % | 0.000644 | 0.00673 | 0.00644 | 0.0283427 | |
Variable % | 0.001300 | 0.00685 | 0.00650 | 0.0272816 | |
Score | 0.959112 |
No solution available for radiationm40-10-02 .
The following instances are most similar to radiationm40-10-02 in the collection. This similarity analysis is based on 100 scaled instance features describing properties of the variables, objective function, bounds, constraints, and right hand sides.
@Inbook{Belov2016,
author="Belov, Gleb
and Stuckey, Peter J.
and Tack, Guido
and Wallace, Mark",
editor="Rueher, Michel",
title="Improved Linearization of Constraint Programming Models",
bookTitle="Principles and Practice of Constraint Programming: 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings",
year="2016",
publisher="Springer International Publishing",
pages="49--65",
isbn="978-3-319-44953-1",
doi="10.1007/978-3-319-44953-1_4",
url="http://dx.doi.org/10.1007/978-3-319-44953-1_4"
}