An upper bound on the number of non-unique assignments in relaxed (mixed) integer linear programs of the assignment type

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

Research output: Book/ReportReportAcademic

28 Downloads (Pure)

Abstract

An upper bound is given for the number of non-unique assignments when solving the linear programming relaxation of (mixed) integer linear programming problems in which the integer variables are governed by assignment type constraints. Key-words: (mixed) integer linear programming, assignment problems, class-room scheduling.
Original languageEnglish
Place of PublicationEindhoven
PublisherTechnische Hogeschool Eindhoven
Number of pages8
Publication statusPublished - 1982

Publication series

NameMemorandum COSOR
Volume8221
ISSN (Print)0926-4493

Fingerprint

Dive into the research topics of 'An upper bound on the number of non-unique assignments in relaxed (mixed) integer linear programs of the assignment type'. Together they form a unique fingerprint.

Cite this