s250r10

benchmark benchmark_suitable aggregations set_partitioning set_packing cardinality invariant_knapsack knapsack mixed_binary

Submitter Variables Constraints Density Status Group Objective MPS File
Daniel Espinoza 273142 10962 4.4039e-04 easy Spinoza -0.1717804834232 s250r10.mps.gz

Wine Scheduling problem with 250 jobs (up to 10 alternatives for processing) and four processing machines

Imported from the MIPLIB2010 submissions.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 273142 272333
Constraints 10962 10702
Binaries 273139 272330
Integers 0 0
Continuous 3 3
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.000440390 0.000416362
Nonzeroes 1318610 1213490
Constraint Classification Properties
Original Presolved
Total 10962 10702
Empty 82 0
Free 0 0
Singleton 79 0
Aggregations 2224 2218
Precedence 0 0
Variable Bound 0 0
Set Partitioning 1612 3345
Set Packing 171 172
Set Covering 171 0
Cardinality 6607 4851
Invariant Knapsack 0 101
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 13 12
Integer Knapsack 0 0
Mixed Binary 3 3
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 0.7781512
Constraint % 7.35377 19.4618 23.7058 28.4526
Variable % 4.49950 19.9918 16.0827 48.5884
Score 0.7433780

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

Similar instances in collection

The following instances are most similar to s250r10 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
s82 open 1690631 1690577 0 54 87878 7022610 Daniel Espinoza Spinoza -33.759620587* numerics aggregations set_partitioning set_packing cardinality invariant_knapsack binpacking knapsack mixed_binary
s55 easy 78141 78137 0 4 9892 317902 Daniel Espinoza Spinoza -22.15177316 benchmark_suitable aggregations set_partitioning set_packing cardinality invariant_knapsack knapsack mixed_binary
neos-780889 easy 182700 182700 0 0 73910 497210 NEOS Server Submission neos-pseudoapplication-94 3421500 binary benchmark_suitable aggregations set_partitioning cardinality mixed_binary
rococoC11-010100 hard 12321 12155 166 0 4010 46955 A. Chabrier, E. Danna, C. Le Pape, L. Perron rococo 20889 decomposition aggregations precedence set_partitioning cardinality invariant_knapsack general_linear
bab6 hard 114240 114240 0 0 29904 1283180 Elmar Swarat bab -284248.2307 benchmark binary benchmark_suitable aggregations precedence set_partitioning set_packing set_covering cardinality invariant_knapsack equation_knapsack knapsack mixed_binary

Reference

No bibliographic information available

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