b2c1s1

aggregations variable_bound mixed_binary

Submitter Variables Constraints Density Status Group Objective MPS File
M. Vyve, Y. Pochet 3872 3904 7.54683e-04 easy c1s1 25687.9 b2c1s1.mps.gz

Lot sizing instance. Solved by Gurobi 4.6.1 (12 threads) in 116575 seconds (January 2012). Imported from MIPLIB2010.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 3872 3872
Constraints 3904 3904
Binaries 288 288
Integers 0 0
Continuous 3584 3584
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.000754683 0.000754683
Nonzeroes 11408 11408
Constraint Classification Properties
Original Presolved
Total 3904 3904
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 16 16
Precedence 0 0
Variable Bound 2560 2560
Set Partitioning 0 0
Set Packing 0 0
Set Covering 0 0
Cardinality 0 0
Invariant Knapsack 0 0
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 1328 1328
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.505150
Constraint % 1.66496 2.43258 1.66496 25.4611
Variable % 1.18802 2.42602 2.11777 25.6198
Score 0.680612

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
2 25687.91 25687.91 0.0e+00 0 0 Michael Winkler 2022-03-29 Solved with Gurobi v9.5.1rc2 using an AMD EPYC 7313P 16-Core processor (32 threads) in 24 minutes.
1 25687.91 25687.91 9.8e-06 0 0 - 2018-10-11 Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to b2c1s1 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
b1c1s1 easy 3872 288 0 3584 3904 11408 M. Vyve, Y. Pochet c1s1 24544.25 benchmark benchmark_suitable aggregations variable_bound mixed_binary
a1c1s1 easy 3648 192 0 3456 3312 10178 M. Vyve, Y. Pochet c1s1 11503.444125 benchmark_suitable aggregations variable_bound mixed_binary
a2c1s1 easy 3648 192 0 3456 3312 10178 M. Vyve, Y. Pochet c1s1 10889.137625 benchmark_suitable aggregations variable_bound mixed_binary
unitcal_7 easy 25755 2856 0 22899 48939 127595 R. O’Neill 19635558.244 benchmark benchmark_suitable precedence variable_bound mixed_binary general_linear
exp-1-500-5-5 easy 990 250 0 740 550 1980 MIPLIB submission pool exp_and_fc 65887 benchmark benchmark_suitable variable_bound set_packing mixed_binary

Reference

@article{FischettiLodi2003,
 author = {Fischetti, Matteo and Lodi, Andrea},
 issn = {0025-5610},
 issue = {1},
 journal = {Mathematical Programming},
 keyword = {Mathematics and Statistics},
 pages = {23-47},
 publisher = {Springer},
 title = {Local branching},
 volume = {98},
 year = {2003}
}

@article{PochetVyve2004,
 author = {Y. Pochet and M. Van Vyve},
 instance = {a1c1s1,tr12-30},
 journal = {INFORMS Journal on Computing},
 language = {English},
 number = {3},
 title = {A General Heuristic for Production Planning Problems},
 volume = {16},
 year = {2004}
}

Last Update Mar 04, 2024 by Julian Manns
generated with R Markdown
© 2023 by Zuse Institute Berlin (ZIB)
Imprint