Models and algorithms for mailing catalogs
RePEc: Research Papers in EconomicsPublished 1 January 1994
Gabriel R. Bitran, Susana Mondschein
Citations1
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper develops heuristics based on the optimal solutions of simplified versions of the problem studied that behave satisfactorily and studies optimal mailing policies in the catalog sales industry when there is limited access to capital.
Abstract
Includes bibliographical references (p. 38-39).
Keywords
Computer Science
Direct Marketing Management
150 Citations1989Mary Lou Roberts, Paul D. Berger
Management ScienceA Branch and Bound Algorithm for the List Selection Problem in Direct Mail Advertising
49 Citations1981F. Robert Dwyer, James R. Evans
This paper describes a branch and bound approach for optimizing a media selection problem, namely, to choose the best set of mailing lists to maximize audience reach and exploits current heuristic approaches which improve computational efficiency.
Medical Entomology and ZoologyStarting and Building Your Catalog Sales Business: Secrets for Success in One of Today's Fastest-Growing Businesses
3 Citations1990Herman Holtz
RePEc: Research Papers in EconomicsMailing catalogs : an optimization approach
2 Citations1993Gabriel R. Bitran, Susana Mondschein