Detailed explanation of the following tables can be found here.
Original | Presolved | |
---|---|---|
Variables | 2700 | 2700 |
Constraints | 125 | 125 |
Binaries | 100 | 100 |
Integers | 0 | 0 |
Continuous | 2600 | 2600 |
Implicit Integers | 0 | 0 |
Fixed Variables | 0 | 0 |
Nonzero Density | 0.0154074 | 0.0154074 |
Nonzeroes | 5200 | 5200 |
Original | Presolved | |
---|---|---|
Total | 125 | 125 |
Empty | 0 | 0 |
Free | 0 | 0 |
Singleton | 0 | 0 |
Aggregations | 0 | 0 |
Precedence | 0 | 0 |
Variable Bound | 0 | 0 |
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 | 125 | 125 |
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.004321 | ||||
Constraint % | 0.8 | 0.8 | 0.8 | 0.8 | |
Variable % | 1.0 | 1.0 | 1.0 | 1.0 | |
Score | 0.792000 |
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 | -8674.343 | -8674.343 | 0 | 8e-07 | 1e-07 | - | 2018-10-13 | Solution found during MIPLIB2017 problem selection. |
The following instances are most similar to pg 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 |
---|---|---|---|---|---|---|---|---|---|---|---|
pg5_34 | easy | 2600 | 100 | 0 | 2500 | 225 | 7700 | M. Dawande | – | -14339.35345 | benchmark decomposition benchmark_suitable mixed_binary |
nh97_potential | easy | 1180 | 630 | 328 | 222 | 1916 | 5748 | MIPLIB submission pool | – | 1418 | benchmark_suitable mixed_binary general_linear |
fhnw-schedule-paira100 | open | 5150 | 5050 | 0 | 100 | 10000 | 29873 | Simon Felix | schedule | -15.1131226682367* | variable_bound mixed_binary |
fhnw-schedule-paira200 | open | 20300 | 20100 | 0 | 200 | 40000 | 119746 | Simon Felix | schedule | -19.2298568218154* | variable_bound mixed_binary |
fhnw-schedule-paira400 | open | 80600 | 80200 | 0 | 400 | 160000 | 479504 | Simon Felix | schedule | -35.4988125672093* | variable_bound mixed_binary |
@article{DawandeGavirneniTayur2006,
author = {M. Dawande and S. Gavirneni and S. Tayur},
instance = {pg,pg5_34},
journal = {Operations Research},
language = {English},
number = {2},
pages = {337--352},
title = {Effective Heuristics for Multiproduct Partial Shipment Models},
volume = {54},
year = {2006}
}