Name | dolom1 |

Download | dolom1.mps.gz |

Solution | dolom1.sol.gz |

Set Membership | Challenge |

Problem Status | Hard |

Problem Feasibility | Feasible |

Originator/Contributor | Double-Click SAS |

Rows | 1803 |

Cols | 11612 |

Num. non-zeros in A | 190413 |

Num. non-zeros in c | 11612 |

Rows/Cols | 0.155270409921 |

Integers | |

Binaries | 9720 |

Continuous | 1892 |

min nonzero |Aij| | 1 |

max |Aij| | 100000000 |

min nonzero |cj| | 200 |

max |cj| | 100000000 |

Integer Objective | 6609253 |

LP Objective | 6556066.068315 |

Aggregation | |

Variable Bound | |

Set partitioning | |

Set packing | |

Set covering | |

Cardinality | |

Equality Knapsacks | |

Bin packing | |

Invariant Knapsack | 1 |

Knapsacks | |

Integer Knapsack | |

Mixed 0/1 | 1803 |

General Cons. | |

References | FischettiGloverLodi2005 FischettiLodi2003 |

Crew scheduling instance. Solved with ParaSCIP with SCIP 3.0.1 linked to CPLEX 12.5 as an LP solver on HLRN III with 12288 cores in two runs First run found a feasible solution whose objective function value is 6615265.0000. Giving the feasible solution, the second run solved the instance in 13684.7671 sec.

Last Update July 31, 2019 by Gerald Gamrath

© 2019 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)

Imprint