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

It can be proved, that tight upperbounds can be given for the number of non-unique assignments that are achieved after solving the linear programming relaxation of some types of mixed integer assignment problems. A simple heuristic can then be used to reach a practically good and feasible assignment.
Original languageEnglish
Title of host publicationDGOR
Subtitle of host publicationPapers of the 12th Annual Meeting / Vorträge der 12. Jahrestagung
EditorsH. Steckhan, W. Bühler, K.E. Jäger, Ch. Schneeweiss, J. Schwarze
Place of PublicationBerlin
PublisherSpringer
Chapter65
Pages297-297
Number of pages1
ISBN (Electronic)978-3-642-69546-9
ISBN (Print)3-540-13134-5, 978-3-540-13134-2
DOIs
Publication statusPublished - 1984
Event12th Annual Meeting of DGOR - Mannheim, Germany
Duration: 21 Sep 198323 Sep 1983

Publication series

NameOperations Research Proceedings (ORP)
Volume1983

Conference

Conference12th Annual Meeting of DGOR
CountryGermany
CityMannheim
Period21/09/8323/09/83

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