Results obtained using Gurobi for solving the Graph Partitioning Problem (GPP), using the models described in Mathematical Optimization: Solving Problems using Python and Gurobi. CPU time limited to 300 seconds. (Click on values for selecting data to display.)

Instance family | Type | Description |

p=0.50 | random | probability (graph density): 0.50 |

p=0.10 | random | probability (graph density): 0.10 |

p=0.05 | random | probability (graph density): 0.05 |

p=0.01 | random | probability (graph density): 0.01 |