Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14473
For citation please use:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorCoughlan, Eamonn T.
dc.contributor.authorLübbecke, Marco E.
dc.contributor.authorSchulz, Jens
dc.date.accessioned2021-12-17T10:09:15Z-
dc.date.available2021-12-17T10:09:15Z-
dc.date.issued2010
dc.identifier.issn2197-8085
dc.identifier.urihttps://depositonce.tu-berlin.de/handle/11303/15700-
dc.identifier.urihttp://dx.doi.org/10.14279/depositonce-14473-
dc.description.abstractResource leveling is a variant of resource-constrained project scheduling in which a non-regular objective function, the resource availability cost, is to be minimized.en
dc.language.isoenen
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subject.ddc510 Mathematiken
dc.subject.otherbranch-and-priceen
dc.subject.otherschedulingen
dc.subject.othermulti-modeen
dc.subject.otherresource levelingen
dc.titleA Branch-and-Price Algorithm for Multi-Mode Resource Levelingen
dc.typeResearch Paperen
tub.accessrights.dnbfreeen
tub.publisher.universityorinstitutionTechnische Universität Berlinen
tub.series.issuenumber2010, 04en
tub.series.namePreprint-Reihe des Instituts für Mathematik, Technische Universität Berlinen
dc.type.versionsubmittedVersionen
tub.affiliationFak. 2 Mathematik und Naturwissenschaften » Inst. Mathematikde
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-004-2010.pdf
Format: Adobe PDF | Size: 198.28 kB
DownloadShow Preview
Thumbnail

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.