bienst1

decomposition benchmark_suitable precedence variable_bound cardinality mixed_binary

Submitter Variables Constraints Density Status Group Objective MPS File
MIPLIB submission pool 505 576 7.50825e-03 easy 46.7499999999999 bienst1.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 505 505
Constraints 576 576
Binaries 28 28
Integers 0 0
Continuous 477 477
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.00750825 0.00750825
Nonzeroes 2184 2184
Constraint Classification Properties
Original Presolved
Total 576 576
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 0 0
Precedence 56 56
Variable Bound 392 392
Set Partitioning 0 0
Set Packing 0 0
Set Covering 0 0
Cardinality 4 4
Invariant Knapsack 0 0
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 124 124
General Linear 0 0
Indicator 0 0

Structure

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

value min median mean max
Components 1.763428
Constraint % 1.21528 1.36452 1.21528 9.72222
Variable % 1.58416 1.75439 1.58416 11.28710
Score 0.756023

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

Similar instances in collection

The following instances are most similar to bienst1 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
bienst2 easy 505 35 0 470 576 2184 H. Mittelmann 54.6 decomposition benchmark_suitable precedence variable_bound cardinality mixed_binary
newdano easy 505 56 0 449 576 2184 Daniel Bienstock dano 65.66666666 decomposition benchmark_suitable precedence variable_bound cardinality mixed_binary
danoint easy 521 56 0 465 664 3232 Daniel Bienstock dano 65.6666666666 benchmark_suitable variable_bound cardinality mixed_binary
ns1430538 hard 33616 1680 0 31936 34960 178112 NEOS Server Submission neos-pseudoapplication-76 88 decomposition precedence variable_bound mixed_binary
rout easy 556 300 15 241 291 2431 MIPLIB submission pool 1077.56 decomposition benchmark_suitable variable_bound set_packing integer_knapsack general_linear

Reference

No bibliographic information available

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