scientific article; zbMATH DE number 5764859

MaRDI QIDQ3579452zbMATH OpenFDO

Authors Nir Halman, Diego Klabjan, Chung-Lun Li, James B. Orlin, David Simchi-Levi

Publication date 6 August 2010

Mathematics Subject Classification ID

Approximation algorithms (68W25) Stochastic programming (90C15)

Cited in

(6)

• A continuous knapsack problem with separable convex utilities: approximation algorithms and applications
• An FPTAS for the single-item capacitated economic lot-sizing problem with supply and demand
• Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand
• A PTAS for a class of stochastic dynamic programs
• Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks
• Approximating the volume of unions and intersections of high-dimensional geometric objects

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication:

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