Optimal selection of customers for a last-minute offer

DOI10.1287/OPRE.1090.0787zbMATH Open1228.90063OpenAlexW2068022645WikidataQ65553908 ScholiaQ65553908MaRDI QIDQ3098282FDOQ3098282

José R. Correa, Roberto Cominetti, Jaime San Martín, Thomas Rothvoß

Publication date: 17 November 2011

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: http://infoscience.epfl.ch/record/130543

Recommendations

• Optimization models for targeted offers in direct marketing: exact and heuristic algorithms
• scientific article
• A new algorithm for the multi-item exponentially discounted optimal selection problem.
• A sequential dynamic pricing model and its applications
• Performance bounds on optimal fixed prices

zbMATH Keywords

approximation algorithmslinear programming relaxationspromotional sale

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Stochastic programming (90C15)

Cited In (3)

• Question selection responding to information on customers from heterogeneous populations to select offers that maximize expected profit
• A Sharp Uniform Bound for the Distribution of Sums of Bernoulli Trials
• Posted Price Mechanisms and Optimal Threshold Strategies for Random Arrivals

This page was built for publication: Optimal selection of customers for a last-minute offer

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