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

Onderzoeksoutput: Boek/rapportRapportAcademic

38 Downloads (Pure)

Samenvatting

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.
Originele taal-2Engels
Plaats van productieEindhoven
UitgeverijTechnische Hogeschool Eindhoven
Aantal pagina's8
StatusGepubliceerd - 1982

Publicatie series

NaamMemorandum COSOR
Volume8221
ISSN van geprinte versie0926-4493

Vingerafdruk

Duik in de onderzoeksthema's van 'An upper bound on the number of non-unique assignments in relaxed (mixed) integer linear programs of the assignment type'. Samen vormen ze een unieke vingerafdruk.

Citeer dit