Optimization models for targeted offers in direct marketing: exact and heuristic algorithms

DOI10.1016/J.EJOR.2010.10.019zbMath1213.90149OpenAlexW2055435231MaRDI QIDQ541729

Frits C. R. Spieksma, Roel Leus, Fabrice Talla Nobibon

Publication date: 7 June 2011

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.10.019

zbMATH Keywords

heuristicsinteger programmingtabu searchnon-approximabilitybranch-and-price algorithmdirect marketing campaign

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Marketing, advertising (90B60)

Related Items (8)

A hybrid variable neighborhood search algorithm for targeted offers in direct marketing ⋮ Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign ⋮ A matheuristic for a customer assignment problem in direct marketing ⋮ A new SOM-based method for profile generation: theory and an application in direct marketing ⋮ A VNS approach for book marketing campaigns generated with quasi-bicliques probabilities ⋮ Optimization models for targeted offers in direct marketing: exact and heuristic algorithms ⋮ A faster FPTAS for knapsack problem with cardinality constraint ⋮ A faster FPTAS for knapsack problem with cardinality constraint

Uses Software

• Knapsack
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization models for targeted offers in direct marketing: exact and heuristic algorithms
• Narrowcasting of wireless advertising in malls
• Tabu search for the multilevel generalized assignment problem
• Retaining students in retail banking through price bundling: evidence from the Swedish market.
• Approximation algorithms for knapsack problems with cardinality constraints
• Quantitative models for direct marketing: A review from systems perspective
• Investigating purchasing-sequence patterns for financial services using Markov, MTD and MTDG models
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• A fuzzy mathematical programming approach for cross-sell optimization in retail banking
• The bottleneck problem with minimum quantity commitments
• Market response models and marketing practice
• Broadcast Scheduling for Mobile Advertising
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• Computing and Combinatorics
• Parallel Machine Scheduling Through Column Generation: Minimax Objective Functions

This page was built for publication: Optimization models for targeted offers in direct marketing: exact and heuristic algorithms