Name | tw-myciel4 |

Download | tw-myciel4.mps.gz |

Solution | tw-myciel4.sol.gz |

Set Membership | Challenge |

Problem Status | Hard |

Problem Feasibility | Feasible |

Originator/Contributor | A. Koster |

Rows | 8146 |

Cols | 760 |

Num. non-zeros in A | 27961 |

Num. non-zeros in c | 1 |

Rows/Cols | 10.7184210526 |

Integers | 1 |

Binaries | 759 |

Continuous | |

min nonzero |Aij| | 1 |

max |Aij| | 1 |

min nonzero |cj| | 1 |

max |cj| | 1 |

Integer Objective | 10 |

LP Objective | 3.838028 |

Aggregation | 71 |

Variable Bound | 688 |

Set partitioning | |

Set packing | |

Set covering | 1771 |

Cardinality | |

Equality Knapsacks | |

Bin packing | |

Invariant Knapsack | 7364 |

Knapsacks | |

Integer Knapsack | |

Mixed 0/1 | |

General Cons. | 23 |

References |

Model to compute the treewidth of the Mycielski-4 instance from the DIMACS graph coloring database. Solved in June 2013 by CPLEX 12.5.1 (12 threads) in about 66 hours. The solving was performed in two steps: first solving with 50 GB tree memory limit (took 11307.42 seconds), after that, setting the tree memory limit to 80 GB and switching to depth first search (took 226152.14 seconds).

Last Update July 31, 2019 by Gerald Gamrath

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

Imprint