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

DOI10.1016/J.IPL.2015.05.001zbMATH Open1330.90094OpenAlexW226129324MaRDI QIDQ2348705FDOQ2348705

Authors: Laurent Gourvès 

Publication date: 15 June 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.05.001

Recommendations

• The finite horizon investor problem with a budget constraint
• Algorithm Theory - SWAT 2004
• The budgeted maximum coverage problem
• Approximation algorithms for a generalization of the maximum budget allocation
• scientific article; zbMATH DE number 1833405

zbMATH Keywords

approximationknapsack problemgreedy algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Scheduling subject to nonrenewable-resource constraints
• Approximation algorithms for NP-hard problems.
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• A fast feasibility test for relocation problems
• Minimizing the total weighted completion time in the relocation problem
• Technical Note—The Multiperiod Knapsack Problem

Cited In (2)

• The finite horizon investor problem with a budget constraint
• The discrete sell or hold problem with constraints on asset values

This page was built for publication: Approximating the optimal sequence of acquisitions and sales with a capped budget

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2348705)