On using the linear programming relaxation of assignment type mixed integer problems

J.A.E.E. van Nunen, J.F. Benders, A.J.M. Beulens

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

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.
Original languageEnglish
Title of host publicationContributions to Operations Research (Proceedings of the Conference on Operations Research, Oberwolfach, Germany, February 26-March 3, 1984)
EditorsK. Neumann, D. Pallaschke
Place of PublicationBerlin
PublisherSpringer
Chapter1
Pages1-9
Number of pages9
ISBN (Electronic)978-3-642-46534-5
ISBN (Print)978-3-540-15205-7
DOIs
Publication statusPublished - 1985

Publication series

NameLecture Notes in Economics and Mathematical Systems
Volume240
ISSN (Print)0075-8442

Fingerprint

Dive into the research topics of 'On using the linear programming relaxation of assignment type mixed integer problems'. Together they form a unique fingerprint.

Cite this