cvrpa-n64k9vrpi

indicator numerics aggregations precedence variable_bound set_partitioning set_packing mixed_binary general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
Gleb Belov 312726 550111 6.1889e-06 open vrp 3143* cvrpa-n64k9vrpi.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

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 312726 228364
Constraints 550111 465312
Binaries 48192 32378
Integers 2259 2259
Continuous 262275 193727
Implicit Integers 500 752
Fixed Variables 441 0
Nonzero Density 6.18890e-06 6.16944e-06
Nonzeroes 1064700 655568
Constraint Classification Properties
Original Presolved
Total 312725 287906
Empty 0 0
Free 0 0
Singleton 819 39314
Aggregations 25509 17634
Precedence 689 67475
Variable Bound 1000 68286
Set Partitioning 252 252
Set Packing 252 252
Set Covering 0 0
Cardinality 0 0
Invariant Knapsack 126 0
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 237012 63126
General Linear 47066 31567
Indicator 237386 237386

Structure

Available nonzero structure and decomposition information. Further information can be found here.

value min median mean max
Components
Constraint %
Variable %
Score

Best Known Solution(s)

Find solutions below. Download the archive containing all solutions from the Download page.

ID Objective Exact Int. Viol Cons. Viol Obj. Viol Submitter Date Description
1 3143 0 0 0 - 2018-10-13 Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to cvrpa-n64k9vrpi 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
cvrpb-n45k5vrpi open 153202 23625 1575 128002 268835 519556 Gleb Belov pb- 2009* indicator numerics aggregations precedence variable_bound set_partitioning set_packing mixed_binary general_linear
cvrpp-n16k8vrpi open 18294 2832 531 14931 31615 60544 Gleb Belov vrp 450* indicator numerics aggregations precedence variable_bound set_partitioning set_packing mixed_binary general_linear
cvrpsimple2i easy 4166 648 243 3275 7023 13248 Gleb Belov vrp 34 indicator numerics aggregations precedence variable_bound set_partitioning set_packing mixed_binary general_linear
stoch-vrpvrp-s5v2c8vrp-v2c8i open 8436 1485 734 6217 13813 26231 Gleb Belov vrp 330* indicator numerics aggregations precedence variable_bound set_partitioning set_packing mixed_binary general_linear
amaze22012-06-28i easy 12691 4376 914 7401 17319 33831 Gleb Belov amaze 0 feasibility indicator numerics aggregations precedence variable_bound set_partitioning cardinality integer_knapsack mixed_binary general_linear

Reference

@article{MZChPhil2010,
year={2010},
journal={Constraints},
volume={15},
number={3},
title={Philosophy of the {MiniZinc} challenge},
publisher={Springer US},
author={Stuckey, P. J. and Becket, R. and Fischer, J.},
pages={307--316},
}
@incollection{BelovEtAl_Lin16,
author="Belov, G.
and Stuckey, P. J.
and Tack, G.
and Wallace, M.",
editor="Rueher, M.",
title="Improved Linearization of Constraint Programming Models",
bookTitle="Principles and Practice of Constraint Programming: 22nd International Conference, CP 2016, Proceedings",
year="2016",
publisher="Springer International Publishing",
pages="49--65",
}

Last Update Jun 24, 2019 by Gregor Hendel
generated with R Markdown
© 2019 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint