A matheuristic for a customer assignment problem in direct marketing
From MaRDI portal
Publication:2171614
DOI10.1016/j.ejor.2022.04.009OpenAlexW4223891542MaRDI QIDQ2171614
Publication date: 9 September 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.04.009
Related Items (1)
Cites Work
- A nonhomogeneous hidden Markov model of response dynamics and mailing optimization in direct marketing
- Optimization models for targeted offers in direct marketing: exact and heuristic algorithms
- Paths, trees and matchings under disjunctive constraints
- A model and solution method for multi-period sales promotion design.
- Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign
- A retail store SKU promotions optimization model for category multi-period profit maximization
- The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
- Exact solution algorithms for the maximum flow problem with additional conflict constraints
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- Assignment problem with conflicts
- A hybrid variable neighborhood search algorithm for targeted offers in direct marketing
- A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts
- A fuzzy mathematical programming approach for cross-sell optimization in retail banking
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
- Why Is Maximum Clique Often Easy in Practice?
- Algorithm 457: finding all cliques of an undirected graph
- Benchmarking optimization software with performance profiles.
This page was built for publication: A matheuristic for a customer assignment problem in direct marketing
