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

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

Samenvatting

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.
Originele taal-2Engels
TitelContributions to Operations Research (Proceedings of the Conference on Operations Research, Oberwolfach, Germany, February 26-March 3, 1984)
RedacteurenK. Neumann, D. Pallaschke
Plaats van productieBerlin
UitgeverijSpringer
Hoofdstuk1
Pagina's1-9
Aantal pagina's9
ISBN van elektronische versie978-3-642-46534-5
ISBN van geprinte versie978-3-540-15205-7
DOI's
StatusGepubliceerd - 1985

Publicatie series

NaamLecture Notes in Economics and Mathematical Systems
Volume240
ISSN van geprinte versie0075-8442

Vingerafdruk

Duik in de onderzoeksthema's van 'On using the linear programming relaxation of assignment type mixed integer problems'. Samen vormen ze een unieke vingerafdruk.

Citeer dit