Name | opt1217 |

Download | opt1217.mps.gz |

Solution | opt1217.sol.gz |

Orginator | Telecommunication Networks Group, TU Berlin |

Formulator | James Gross |

Donator | Hans-Florian Geerdes |

Rows | 64 |

Cols | 769 |

Non-zeros | 1542 |

Integers | |

Binaries | 768 |

Continuous | |

|Min| | 1.00000000e+00 |

|Max| | 8.00000000e+00 |

Integer Objective | -16 |

LP Objective | -2.00213904e+01 |

Root LP Basis | opt1217.bas.gz |

Set partitioning | 48 |

Set packing | |

Set covering | |

Cardinality | |

Equality Knapsacks | |

Bin packing | |

Invariant Knapsack | |

Knapsacks | |

Integer Knapsack | |

Upper bounds | |

Lower bounds | |

Mixed 0/1 | 16 |

General Cons. | |

References | Gross2004 |

The MIP represents one instance of time in the swiftly changing wireless environment of an OFMD system (orthogonal frequency division multiplexing). The radio spectrum is subdivided into several subcarriers. Due to signal fading, the possible data rate that can be transmitted over a subcarrier varies greatly from mobile to mobile. Each mobile may be assigned one or more subcarriers, the objective is to maximize the minimum data throuhghput that any mobile gets.

Extensive generation of Gomory and MIR-cuts is helpful to solve this instance.

Last Update : 2010/06/09 13:56:11 $ by Gerald Gamrath

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

Imprint