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: Book/ReportReportAcademic

98 Downloads (Pure)

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. Keywords: mixed integer problems, assignment problems, time tables, linear programming.
Original languageEnglish
Place of PublicationEindhoven
PublisherTechnische Hogeschool Eindhoven
Number of pages7
Publication statusPublished - 1983

Publication series

NameMemorandum COSOR
Volume8320
ISSN (Print)0926-4493

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