• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - Request a copy

Approximating the optimal sequence of acquisitions and sales with a capped budget

Gourvès, Laurent (2015), Approximating the optimal sequence of acquisitions and sales with a capped budget, Information Processing Letters, 115, 10, p. 760-764. 10.1016/j.ipl.2015.05.001

Type
Article accepté pour publication ou publié
Date
2015
Journal name
Information Processing Letters
Volume
115
Number
10
Publisher
Elsevier
Pages
760-764
Publication identifier
10.1016/j.ipl.2015.05.001
Metadata
Show full item record
Author(s)
Gourvès, Laurent
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
We 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.
Subjects / Keywords
Approximation; Greedy algorithms; Knapsack problem
JEL
C44 - Operations Research; Statistical Decision Theory

Related items

Showing items related by title and author.

  • Thumbnail
    Approximating the Pareto Curve with Local Search for the Bicriteria TSP (1, 2) Problem (extended abstract) 
    Angel, Eric; Bampis, Evripidis; Gourvès, Laurent (2003) Communication / Conférence
  • Thumbnail
    Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem 
    Angel, Eric; Bampis, Evripidis; Gourvès, Laurent (2004) Article accepté pour publication ou publié
  • Thumbnail
    Covering Clients with Types and Budgets 
    Fotakis, Dimitris; Gourvès, Laurent; Mathieu, Claire; Srivastav, Abhinav (2018) Communication / Conférence
  • Thumbnail
    Optimal sequencing of mixed models with sequence-dependent setups and utility workers on an assembly line 
    Giard, Vincent; Jeunet, Jully (2010) Article accepté pour publication ou publié
  • Thumbnail
    On Fairness via Picking Sequences in Allocation of Indivisible Goods 
    Gourvès, Laurent; Lesca, Julien; Wilczynski, Anaëlle (2021) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo