hypothyroid-k1

benchmark benchmark_suitable aggregations precedence set_covering binpacking general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
Gleb Belov 2602 5195 3.20982e-02 easy hypothyroid -2851 hypothyroid-k1.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

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 2602 2599
Constraints 5195 5195
Binaries 2601 2598
Integers 1 1
Continuous 0 0
Implicit Integers 0 1
Fixed Variables 3 0
Nonzero Density 0.0320982 0.0321353
Nonzeroes 433884 433884
Constraint Classification Properties
Original Presolved
Total 5195 5195
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 2 2
Precedence 2 2
Variable Bound 0 0
Set Partitioning 0 0
Set Packing 0 0
Set Covering 0 2595
Cardinality 0 0
Invariant Knapsack 3 0
Equation Knapsack 0 0
Bin Packing 2595 2595
Knapsack 2592 0
Integer Knapsack 0 0
Mixed Binary 0 0
General Linear 1 1
Indicator 0 0

Structure

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

value min median mean max
Components 0.301030
Constraint % 99.9038 99.9038 99.9038 99.9038
Variable % 99.7694 99.7694 99.7694 99.7694
Score 0.002304

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 -2851 -2851 0 0 0 - 2018-10-12 Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to hypothyroid-k1 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
k1mushroom easy 8211 8210 1 0 16419 1697946 Gleb Belov k1mushroom -3288 benchmark benchmark_suitable set_covering binpacking general_linear
splice1k1 hard 3253 3252 1 0 6505 1761016 Gleb Belov splice -394 benchmark benchmark_suitable set_covering binpacking general_linear
usafa open 228648 216357 12291 0 1377561 16485102 Christopher Daniel Richards 160.1671357657* aggregations precedence variable_bound set_partitioning set_packing invariant_knapsack binpacking integer_knapsack general_linear
neos8 easy 23228 23224 4 0 46324 313180 NEOS Server Submission neos-pseudoapplication-15 -3719 benchmark benchmark_suitable precedence set_packing cardinality invariant_knapsack binpacking general_linear
neos-738098 easy 9093 8946 0 147 25849 101360 NEOS Server Submission neos-pseudoapplication-15 -1099 benchmark_suitable precedence variable_bound set_partitioning set_packing cardinality invariant_knapsack equation_knapsack binpacking mixed_binary general_linear

Reference

@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"
}

Last Update Mar 04, 2024 by Julian Manns
generated with R Markdown
© 2023 by Zuse Institute Berlin (ZIB)
Imprint