The selection of clients for promotion campaigns by means of mathematical programming

F. Talla Nobibon, R. Leus, F.C.R. Spieksma

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

This paper presents an optimization model for the selection of sets of clients that will receive an offer for one or more products during a promotion campaign. The complexity of the problem makes it very difficult to produce optimal solutions using standard optimization methods. We propose an alternative set covering formulation and develop a branch-and-price algorithm to solve it. We also describe seven heuristics to approximate an optimal solution. We perform extensive computational experiments for the two formulations as well as for the seven heuristics.

Original languageEnglish
Title of host publicationIEEM 2009 - IEEE International Conference on Industrial Engineering and Engineering Management
Place of PublicationPiscataway
PublisherInstitute of Electrical and Electronics Engineers
Pages286-290
Number of pages5
ISBN (Print)978-1-4244-4869-2
DOIs
Publication statusPublished - 2009
Externally publishedYes
Event2009 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM 2009) - Hong Kong, Hong Kong
Duration: 8 Dec 200911 Dec 2009
Conference number: 2009

Conference

Conference2009 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM 2009)
Abbreviated titleIEEM
CountryHong Kong
CityHong Kong
Period8/12/0911/12/09

Keywords

  • Branch-and-price algorithm
  • Heuristics
  • Integer programming
  • Non-approximability
  • Promotion campaign

Fingerprint Dive into the research topics of 'The selection of clients for promotion campaigns by means of mathematical programming'. Together they form a unique fingerprint.

Cite this