Submitter | Variables | Constraints | Density | Status | Group | Objective | MPS File |
---|---|---|---|---|---|---|---|
Gleb Belov | 25124 | 1320 | 4.66456e-03 | open | pb- | -449302.0* | pb-grow22.mps.gz |
These are the instances from MiniZinc Challenges 2012-2016 (see www.minizinc.org), compiled for MIP WITH INDICATOR CONSTRAINTS using the develop branch of MiniZinc and CPLEX 12.7.1 on 30 April 2017. Thus, these instances can only be handled by solvers accepting indicator constraints. For instances compiled with big-M/domain decomposition only, see my previous submission to MIPLIB. To recompile, create a directory MODELS, a list lst12_16.txt of the instances with full paths to mzn/dzn files of each instance per line, and say \(> ~/install/libmzn/tests/benchmarking/mzn-test.py -l ../lst12_16.txt --slvPrf MZN-CPLEX --debug 1 --addOption "--timeout 3 -D fIndConstr=true -D fMIPdomains=false" --useJoinedName "--writeModel MODELS_IND/%s.mps" Alternatively, you can compile individual instance as follows:\)> mzn-cplex -v -s -G linear –output-time ../challenge_2012_2016/mznc2016_probs/zephyrus/zephyrus.mzn ../challenge_2012_2016/mznc2016_p/zephyrus/14__8__6__3.dzn -a –timeout 3 -D fIndConstr=true -D fMIPdomains=false –writeModel MODELS_IND/challenge_2012_2016mznc2016_probszephyruszephyrusmzn-challenge_2012_2016mznc2016_probszephyrus14__8__6__3dzn.mps Imported from the MIPLIB2010 submissions.
Detailed explanation of the following tables can be found here.
Original | Presolved | |
---|---|---|
Variables | 25124 | 25124 |
Constraints | 1320 | 1320 |
Binaries | 25124 | 25124 |
Integers | 0 | 0 |
Continuous | 0 | 0 |
Implicit Integers | 0 | 0 |
Fixed Variables | 0 | 0 |
Nonzero Density | 0.00466456 | 0.00466456 |
Nonzeroes | 154694 | 154694 |
Original | Presolved | |
---|---|---|
Total | 1320 | 1320 |
Empty | 0 | 0 |
Free | 0 | 0 |
Singleton | 0 | 0 |
Aggregations | 0 | 0 |
Precedence | 0 | 0 |
Variable Bound | 0 | 0 |
Set Partitioning | 0 | 0 |
Set Packing | 0 | 0 |
Set Covering | 0 | 0 |
Cardinality | 0 | 0 |
Invariant Knapsack | 0 | 0 |
Equation Knapsack | 440 | 440 |
Bin Packing | 0 | 0 |
Knapsack | 0 | 880 |
Integer Knapsack | 0 | 0 |
Mixed Binary | 880 | 0 |
General Linear | 0 | 0 |
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 | 2.944976 | ||||
Constraint % | 0.0757576 | 0.0757576 | 0.0757576 | 0.0757576 | |
Variable % | 0.0875657 | 0.1046810 | 0.1034870 | 0.1233880 | |
Score | 0.665969 |
Find solutions below. Download the archive containing all solutions from the Download page.
## Warning in lapply(df["exactobjval"], as.numeric): NAs introduced by coercion
ID | Objective | Exact | Int. Viol | Cons. Viol | Obj. Viol | Submitter | Date | Description |
---|---|---|---|---|---|---|---|---|
9 | -449302 | -449302 | 0 | 0 | 0 | Shunsuke Kamiya | 2025-01-16 | Computed with a weighting local search with exploiting variable associations (WLS), based on the paper: Umetani, Shunji. “Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs.” |
8 | -417980 | -417980 | 0 | 0 | 0 | Mars Davletshin | 2024-10-24 | It was obtained with OptVerse. |
7 | -417852 | -417852 | 0 | 0 | 0 | Ankan Bose | 2024-07-15 | Obtained using CP-SAT, iteratively using basic local branching with K=10 and luck. |
6 | -417442 | -417442 | 0 | 0 | 0 | Mars Davletshin | 2023-11-27 | It was obtained with Huawei OptVerse solver using neural heuristic. |
5 | -417287 | -417287 | 0 | 0 | 0 | Ankan Bose | 2023-11-23 | / |
4 | -415243 | -415243 | 0 | 0 | 0 | Yuji Koguma | 2021-09-14 | Computed with weighting local search (WLS) implemented in Numerical Optimizer V23. |
3 | -372049 | -372049 | 0 | 0 | 0 | Edward Rothberg | 2020-11-25 | Found with Gurobi 9.1 NoRel heuristics |
2 | -342763 | -342763 | 0 | 0 | 0 | Shunsuke Kamiya | 2020-05-17 | Computed with weighting local search with exploiting variable associations (WLS) ([1]) [1] Umetani, Shunji. “Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs.” European Journal of Operational Research 263.1 (2017): 72-81. |
1 | -82358 | 0 | 0 | 0 | Edward Rothberg | 2019-12-13 | Obtained with Gurobi 9.0 |
The following instances are most similar to pb-grow22 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.
Instance | Status | Variables | Binaries | Integers | Continuous | Constraints | Nonz. | Submitter | Group | Objective | Tags |
---|---|---|---|---|---|---|---|---|---|---|---|
pb-gfrd-pnc | open | 27888 | 27888 | 0 | 0 | 874 | 60737 | Gleb Belov | pb- | 8844.0* | binary equation_knapsack binpacking knapsack |
mik-250-20-75-5 | easy | 270 | 75 | 175 | 20 | 195 | 9270 | MIPLIB submission pool | mik_250 | -51532 | general_linear |
mik-250-20-75-4 | easy | 270 | 75 | 175 | 20 | 195 | 9270 | MIPLIB submission pool | mik_250 | -52301 | benchmark benchmark_suitable general_linear |
mik-250-20-75-3 | easy | 270 | 75 | 175 | 20 | 195 | 9270 | MIPLIB submission pool | mik_250 | -52242 | general_linear |
mik-250-20-75-1 | easy | 270 | 75 | 175 | 20 | 195 | 9270 | MIPLIB submission pool | mik_250 | -49716 | general_linear |
No bibliographic information available