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

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

doi:10.1109/IEEM.2009.5373361

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 proceeding › Conference contribution › Academic › peer-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 language	English
Title of host publication	IEEM 2009 - IEEE International Conference on Industrial Engineering and Engineering Management
Place of Publication	Piscataway
Publisher	Institute of Electrical and Electronics Engineers
Pages	286-290
Number of pages	5
ISBN (Print)	978-1-4244-4869-2
DOIs	https://doi.org/10.1109/IEEM.2009.5373361
Publication status	Published - 2009
Externally published	Yes
Event	2009 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2009 - Hong Kong, Hong Kong Duration: 8 Dec 2009 → 11 Dec 2009

Conference

Conference	2009 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2009
Abbreviated title	IEEM 2009
Country/Territory	Hong Kong
City	Hong Kong
Period	8/12/09 → 11/12/09

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 9 Industry, Innovation, and Infrastructure

Keywords

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

Access to Document

10.1109/IEEM.2009.5373361

Cite this

@inproceedings{da0fc4026ead461a8aa0f2307a4fdf53,

title = "The selection of clients for promotion campaigns by means of mathematical programming",

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.",

keywords = "Branch-and-price algorithm, Heuristics, Integer programming, Non-approximability, Promotion campaign",

author = "\{Talla Nobibon\}, F. and R. Leus and F.C.R. Spieksma",

year = "2009",

doi = "10.1109/IEEM.2009.5373361",

language = "English",

isbn = "978-1-4244-4869-2 ",

pages = "286--290",

booktitle = "IEEM 2009 - IEEE International Conference on Industrial Engineering and Engineering Management",

publisher = "Institute of Electrical and Electronics Engineers",

address = "United States",

note = "2009 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2009, IEEM 2009 ; Conference date: 08-12-2009 Through 11-12-2009",

}

Talla Nobibon, F, Leus, R & Spieksma, FCR 2009, The selection of clients for promotion campaigns by means of mathematical programming. in IEEM 2009 - IEEE International Conference on Industrial Engineering and Engineering Management., 5373361, Institute of Electrical and Electronics Engineers, Piscataway, pp. 286-290, 2009 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2009, Hong Kong, Hong Kong, 8/12/09. https://doi.org/10.1109/IEEM.2009.5373361

The selection of clients for promotion campaigns by means of mathematical programming. / Talla Nobibon, F.; Leus, R.; Spieksma, F.C.R.
IEEM 2009 - IEEE International Conference on Industrial Engineering and Engineering Management. Piscataway: Institute of Electrical and Electronics Engineers, 2009. p. 286-290 5373361.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

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

AU - Talla Nobibon, F.

AU - Leus, R.

AU - Spieksma, F.C.R.

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

KW - Branch-and-price algorithm

KW - Heuristics

KW - Integer programming

KW - Non-approximability

KW - Promotion campaign

UR - https://www.scopus.com/pages/publications/77949515920

U2 - 10.1109/IEEM.2009.5373361

DO - 10.1109/IEEM.2009.5373361

M3 - Conference contribution

AN - SCOPUS:77949515920

SN - 978-1-4244-4869-2

SP - 286

EP - 290

BT - IEEM 2009 - IEEE International Conference on Industrial Engineering and Engineering Management

PB - Institute of Electrical and Electronics Engineers

CY - Piscataway

T2 - 2009 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2009

Y2 - 8 December 2009 through 11 December 2009

ER -

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

Abstract

Conference

UN SDGs

Keywords

Access to Document

Other files and links

Fingerprint

Cite this