neos-5083528-gimone

feasibility benchmark_suitable set_partitioning cardinality integer_knapsack general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
Jeff Linderoth 60315 617 1.03313e-02 easy neos-pseudoapplication-67 0 neos-5083528-gimone.mps.gz

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 60315 60314
Constraints 617 604
Binaries 4792 4792
Integers 55509 55509
Continuous 14 13
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.0103313 0.0105531
Nonzeroes 384472 384446
Constraint Classification Properties
Original Presolved
Total 617 604
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 0 0
Precedence 13 0
Variable Bound 0 0
Set Partitioning 44 96
Set Packing 0 0
Set Covering 0 0
Cardinality 244 192
Invariant Knapsack 0 0
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 1 1
Mixed Binary 0 0
General Linear 315 315
Indicator 0 0

Structure

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

value min median mean max
Components 1.732394
Constraint % 0.1655630 0.902786 0.827815 1.49007
Variable % 0.0663196 1.886390 0.116059 92.03340
Score 0.476097

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

Similar instances in collection

The following instances are most similar to neos-5083528-gimone 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
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
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
triptim4 open 27226 18537 8682 7 14361 520532 MIPLIB submission pool triptim 9.8181* aggregations precedence variable_bound set_partitioning set_packing set_covering invariant_knapsack general_linear
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
neos-3572885-glina easy 57196 34272 22924 0 44206 157180 Jeff Linderoth neos-pseudoapplication-38 0 feasibility set_partitioning integer_knapsack 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