triptim4

aggregations precedence variable_bound set_partitioning set_packing set_covering invariant_knapsack general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
MIPLIB submission pool 27226 14361 1.33131e-03 open triptim 9.8181* triptim4.mps.gz

Imported from the MIPLIB2010 submissions.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 27226 23300
Constraints 14361 14354
Binaries 18537 14628
Integers 8682 8666
Continuous 7 6
Implicit Integers 0 0
Fixed Variables 6 0
Nonzero Density 0.00133131 0.00150947
Nonzeroes 520532 504841
Constraint Classification Properties
Original Presolved
Total 14361 14354
Empty 0 0
Free 0 0
Singleton 3 0
Aggregations 14 13
Precedence 1 1
Variable Bound 6 5
Set Partitioning 0 16
Set Packing 1888 1888
Set Covering 3764 1880
Cardinality 0 0
Invariant Knapsack 5 1887
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 0 0
General Linear 8680 8664
Indicator 0 0

Structure

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

value min median mean max
Components 1.176091
Constraint % 0.00697 2.8235 0.0069700 19.6879
Variable % 0.00858 2.8740 0.0128755 20.1202
Score 0.316708

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

Similar instances in collection

The following instances are most similar to triptim4 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
triptim1 easy 30055 20456 9592 7 15706 515436 MIPLIB submission pool triptim 22.8680999999999 benchmark benchmark_suitable aggregations precedence variable_bound set_partitioning set_packing set_covering invariant_knapsack general_linear
triptim7 open 27342 18619 8716 7 14427 521944 MIPLIB submission pool triptim 2566.02* aggregations variable_bound set_partitioning set_packing set_covering invariant_knapsack mixed_binary general_linear
triptim2 hard 27326 20776 6543 7 14427 521898 MIPLIB submission pool triptim 12.0051 aggregations precedence variable_bound set_partitioning set_packing set_covering cardinality invariant_knapsack general_linear
triptim8 open 27342 18619 8716 7 14427 521945 MIPLIB submission pool triptim 2566.069* aggregations variable_bound set_partitioning set_packing set_covering invariant_knapsack mixed_binary general_linear
supportcase34 easy 17879 11196 6682 1 15170 748887 Domenico Salvagnin 83.99999986 benchmark_suitable aggregations precedence variable_bound set_partitioning cardinality invariant_knapsack knapsack integer_knapsack mixed_binary general_linear

Reference

No bibliographic information available

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