Submitter | Variables | Constraints | Density | Status | Group | Objective | MPS File |
---|---|---|---|---|---|---|---|

Simon Felix | 5150 | 10000 | 5.80058e-04 | open | schedule | -15.1131226682367* | fhnw-schedule-paira100.mps.gz |

Continuous-time project scheduling and selection, inspired by an industry use-case. Each project has a value, the sum should be maximized. Each project has a deadline, and an earliest start date. Three formulations of the same problem (“Pair A”, “Pair B” and “Slot”) - we expect “Pair B” to be the best formulation.

Detailed explanation of the following tables can be found here.

Original | Presolved | |
---|---|---|

Variables | 5150 | 5123 |

Constraints | 10000 | 9973 |

Binaries | 5050 | 5023 |

Integers | 0 | 0 |

Continuous | 100 | 100 |

Implicit Integers | 0 | 0 |

Fixed Variables | 0 | 0 |

Nonzero Density | 0.000580058 | 0.000584166 |

Nonzeroes | 29873 | 29846 |

Original | Presolved | |
---|---|---|

Total | 10000 | 9973 |

Empty | 0 | 0 |

Free | 0 | 0 |

Singleton | 27 | 0 |

Aggregations | 0 | 0 |

Precedence | 0 | 0 |

Variable Bound | 73 | 73 |

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 | 9900 | 9900 |

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 | 0.301030 | ||||

Constraint % | 99.2680 | 99.2680 | 99.2680 | 99.2680 | |

Variable % | 98.5751 | 98.5751 | 98.5751 | 98.5751 | |

Score | 0.014145 |

Find solutions below. Download the archive containing all solutions from the Download page.

`## Warning in lapply(df["exactobjval"], as.numeric): NAs introduced by coercion`

ID | Objective | Exact | Int. Viol | Cons. Viol | Obj. Viol | Submitter | Date | Description |
---|---|---|---|---|---|---|---|---|

3 | -15.11312 | 8.1e-06 | 0 | 0 | Edward Rothberg | 2019-12-13 | Obtained with Gurobi 9.0 | |

2 | -14.50791 | 0.0e+00 | 0 | 0 | Robert Ashford and Alkis Vazacopoulus | 2019-12-18 | Found using ODH|CPlex | |

1 | -14.22604 | -14.22604 | 0.0e+00 | 0 | 0 | - | 2018-10-10 | Solution found during MIPLIB2017 problem selection. |

The following instances are most similar to fhnw-schedule-paira100 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 |
---|---|---|---|---|---|---|---|---|---|---|---|

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 |

nh97_potential | easy | 1180 | 630 | 328 | 222 | 1916 | 5748 | MIPLIB submission pool | – | 1418 | benchmark_suitable mixed_binary general_linear |

pg | easy | 2700 | 100 | 0 | 2600 | 125 | 5200 | M. Dawande | – | -8674.34260712 | benchmark decomposition benchmark_suitable mixed_binary |

ic97_potential | easy | 728 | 450 | 73 | 205 | 1046 | 3138 | L. Peeters | – | 3941.99993090225 | benchmark benchmark_suitable precedence mixed_binary general_linear |

`No bibliographic information available`

Last Update 2024 by Julian Manns

generated with R Markdown

© by Zuse Institute Berlin (ZIB)

Imprint