## Abstract

In this paper we combine some results that are published elsewhere. We prove that tight upperbounds can be given for the number of non-unique assignments that remain after solving the linear programming relaxation of some types of assignment problems.

For the generalized assignment problem and time table problems we will give these bounds explicitly.

Moreover, we will give bounds for the required capacity to ensure easy solutions.

For the generalized assignment problem and time table problems we will give these bounds explicitly.

Moreover, we will give bounds for the required capacity to ensure easy solutions.

Original language | English |
---|---|

Title of host publication | Contributions to Operations Research (Proceedings of the Conference on Operations Research, Oberwolfach, Germany, February 26-March 3, 1984) |

Editors | K. Neumann, D. Pallaschke |

Place of Publication | Berlin |

Publisher | Springer |

Chapter | 1 |

Pages | 1-9 |

Number of pages | 9 |

ISBN (Electronic) | 978-3-642-46534-5 |

ISBN (Print) | 978-3-540-15205-7 |

DOIs | |

Publication status | Published - 1985 |

### Publication series

Name | Lecture Notes in Economics and Mathematical Systems |
---|---|

Volume | 240 |

ISSN (Print) | 0075-8442 |