Submitter | Variables | Constraints | Density | Status | Group | Objective | MPS File |
---|---|---|---|---|---|---|---|
A. Miller | 2080 | 6310 | 1.12726e-03 | hard | – | 2300867 | dg012142.mps.gz |
Multilevel lot-sizing instance This instance was solved by using 256 cores of the distributed-memory supercomputer Fujitsu PRIMERGY RX200S5 (https://www.ism.ac.jp/computer_system/eng/sc/super.html). The problem was solved by ParaSCIP in approximately 43 hours. Imported from MIPLIB2010.
Detailed explanation of the following tables can be found here.
Original | Presolved | |
---|---|---|
Variables | 2080 | 1964 |
Constraints | 6310 | 2045 |
Binaries | 640 | 600 |
Integers | 0 | 0 |
Continuous | 1440 | 1364 |
Implicit Integers | 0 | 0 |
Fixed Variables | 0 | 0 |
Nonzero Density | 0.00112726 | 0.00255379 |
Nonzeroes | 14795 | 10257 |
Original | Presolved | |
---|---|---|
Total | 6310 | 2045 |
Empty | 0 | 0 |
Free | 0 | 0 |
Singleton | 4213 | 0 |
Aggregations | 6 | 6 |
Precedence | 0 | 33 |
Variable Bound | 701 | 661 |
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 | 1390 | 1345 |
General Linear | 0 | 0 |
Indicator | 0 | 0 |
Available nonzero structure and decomposition information. Further information can be found here.
Decomposed structure of original problem (dec-file)
Decomposed structure after trivial presolving (dec-file)
value | min | median | mean | max | |
---|---|---|---|---|---|
Components | 2.634477 | ||||
Constraint % | 0.0488998 | 0.113152 | 0.0488998 | 7.82396 | |
Variable % | 0.0998004 | 0.164206 | 0.0998004 | 7.58483 | |
Score | 0.473154 |
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 | 2311267 | 2311267 | 0 | 0 | 1e-07 | - | 2018-10-13 | Solution found during MIPLIB2017 problem selection. |
1 | 2300867 | 2300867 | 0 | 0 | 0e+00 | - | 2018-10-13 | Solution found during MIPLIB2017 problem selection. |
The following instances are most similar to dg012142 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 |
---|---|---|---|---|---|---|---|---|---|---|---|
bg512142 | hard | 792 | 240 | 0 | 552 | 1307 | 3953 | A. Miller | – | 184202.75 | aggregations precedence variable_bound mixed_binary |
tr12-30 | easy | 1080 | 360 | 0 | 720 | 750 | 2508 | MIPLIB submission pool | – | 130595.9999999999 | benchmark decomposition benchmark_suitable aggregations variable_bound mixed_binary |
neos-3754480-nidda | easy | 253 | 50 | 0 | 203 | 402 | 1488 | Jeff Linderoth | neos-pseudoapplication-107 | 12941.73838561778 | benchmark benchmark_suitable precedence variable_bound knapsack 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 |
@article{AkartunaliMiller2009,
author = {Akartunal{\i}, K. and A. J. Miller},
journal = {European Journal of Operational Research},
pages = {396-411},
title = {A Heuristic Approach for Big Bucket Multi-Level Production Planning
Problems},
volume = {193},
year = {2009}
}
@article{FischettiGloverLodi2005,
author = {M. Fischetti and F. Glover and A. Lodi},
journal = {Mathematical Programming},
pages = {91--104},
title = {The feasibility pump},
volume = {104},
year = {2005}
}
@article{Stadtler2003,
author = {Stadtler, Hartmut},
journal = {Operations Research},
number = {3},
pages = {487-502},
title = {Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows},
volume = {51},
year = {2003}
}