Show simple item record

dc.contributor.authorGourvès, Laurent
dc.date.accessioned2017-01-05T09:32:04Z
dc.date.available2017-01-05T09:32:04Z
dc.date.issued2015
dc.identifier.issn0020-0190
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/16125
dc.language.isoenen
dc.subjectApproximationen
dc.subjectGreedy algorithmsen
dc.subjectKnapsack problemen
dc.subject.ddc003en
dc.subject.classificationjelC.C4.C44en
dc.titleApproximating the optimal sequence of acquisitions and sales with a capped budgeten
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenWe introduce and study the approximability of the following problem. There is a set of useful objects that are available for purchase, and another set of useless objects that can be sold. Selling useless objects generates revenue which allows to acquire useful objects. We search for a sequence of decisions (buying or selling objects) which optimizes either the number of purchased objects or their global utility. One of the constraints is that, at any time, only a limited amount of money can be held.en
dc.relation.isversionofjnlnameInformation Processing Letters
dc.relation.isversionofjnlvol115en
dc.relation.isversionofjnlissue10en
dc.relation.isversionofjnldate2015-10
dc.relation.isversionofjnlpages760-764en
dc.relation.isversionofdoi10.1016/j.ipl.2015.05.001en
dc.relation.isversionofjnlpublisherElsevieren
dc.subject.ddclabelRecherche opérationnelleen
dc.relation.forthcomingnonen
dc.relation.forthcomingprintnonen
dc.description.ssrncandidatenonen
dc.description.halcandidateouien
dc.description.readershiprechercheen
dc.description.audienceInternationalen
dc.relation.Isversionofjnlpeerreviewedouien
dc.relation.Isversionofjnlpeerreviewedouien
dc.date.updated2017-01-05T09:19:52Z
hal.person.labIds989
hal.identifierhal-01426933*


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record