seqsolve3short4288excess384

no_solution aggregations variable_bound set_packing invariant_knapsack binpacking knapsack integer_knapsack mixed_binary general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
Irv Lustig 207665 242245 2.04485e-05 open seqsolve NA seqsolve3short4288excess384.mps.gz

The 3 problems in this group (seqsolve1–seqsolve3) represent a hierarchical optimization process, which is derived from a customer problem for assigning people to sites into blocks of time on days of the week. The specialty of this submission is that the best known solution for seqsolveX can be used as a MIP start for seqsolveX+1. For a description of the connections between the problems, please refer to the README.txt contained in the model data for this submission, which also includes MIP start files and a Gurobi log file.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 207665 174335
Constraints 242245 199220
Binaries 123834 97763
Integers 82835 75576
Continuous 996 996
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 2.04485e-05 2.52641e-05
Nonzeroes 1028680 877447
Constraint Classification Properties
Original Presolved
Total 242245 199220
Empty 0 0
Free 0 0
Singleton 149 0
Aggregations 0 121
Precedence 12381 0
Variable Bound 178200 151260
Set Partitioning 0 0
Set Packing 151 56
Set Covering 0 0
Cardinality 0 0
Invariant Knapsack 282 251
Equation Knapsack 0 0
Bin Packing 31442 28976
Knapsack 16222 15398
Integer Knapsack 2918 2779
Mixed Binary 34 2
General Linear 466 377
Indicator 0 0

Structure

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

value min median mean max
Components
Constraint %
Variable %
Score

Best Known Solution(s)

No solution available for seqsolve3short4288excess384 .

Similar instances in collection

The following instances are most similar to seqsolve3short4288excess384 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
seqsolve2short4288 open 207665 123834 82835 996 242244 1028180 Irv Lustig seqsolve no_solution aggregations variable_bound set_packing invariant_knapsack binpacking knapsack integer_knapsack mixed_binary general_linear
seqsolve1 open 207665 123834 82835 996 242243 1027680 Irv Lustig seqsolve 4279* aggregations variable_bound set_packing invariant_knapsack binpacking knapsack integer_knapsack general_linear
neos-4165869-wannon hard 31728 480 31248 0 85865 270474 Hans Mittelmann neos-pseudoapplication-44 293 precedence variable_bound set_partitioning set_packing invariant_knapsack integer_knapsack general_linear
neos-4360552-sangro open 10272 9696 576 0 46012 302184 Hans Mittelmann neos-pseudoapplication-62 -7* decomposition precedence variable_bound set_packing set_covering cardinality invariant_knapsack equation_knapsack binpacking knapsack integer_knapsack general_linear
uccase8 easy 37413 9576 0 27837 53709 214625 Daniel Espinoza uccase 11167.74532 benchmark_suitable aggregations variable_bound set_partitioning invariant_knapsack binpacking knapsack mixed_binary

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