2015
DOI: 10.1057/jors.2014.64
|View full text |Cite
|
Sign up to set email alerts
|

A column generation heuristic for districting the price of a financial product

Abstract: This paper studies a districting problem that arises in the context of financial product pricing. The challenge lies in partitioning a set of small geographical regions into a set of larger territories. In each territory, the customers will share a common price. These territories need to be contiguous, contain enough customers and be as homogeneous as possible in terms of customer value. To address this problem, we present a column generation-based heuristic where the subproblem generates contiguous territorie… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 35 publications
0
3
0
Order By: Relevance
“…Instead of using the traditional branch-and-bound method for solving the problem, it imposes heuristic branching decisions that are permanent. This method of branching was used by, e.g., de Fréminville et al [11]. Each step in the branching heuristic is a part of breaking the symmetry in the decision variables.…”
Section: Branching Heuristicsmentioning
confidence: 99%
See 1 more Smart Citation
“…Instead of using the traditional branch-and-bound method for solving the problem, it imposes heuristic branching decisions that are permanent. This method of branching was used by, e.g., de Fréminville et al [11]. Each step in the branching heuristic is a part of breaking the symmetry in the decision variables.…”
Section: Branching Heuristicsmentioning
confidence: 99%
“…The objective function heavily penalises this variable, such that the variable only activates if no other possibility exists. Constraints ( 10)- (11) state that each brick placement variable x b is a real number between 0 and 1. Constraints ( 12)-( 13) state that each voxel variable o v is a real number between 0 and 1.…”
Section: Lp Relaxationmentioning
confidence: 99%
“…The authors incorporate some heuristic elements to increase computational efficiency, e.g., simplified contiguity constraints and distance-based variable fixing. de Fréminville et al (2015) deal with a special single-period districting problem which they call the financial product districting problem. In this problem, customers must be partitioned into territories such that the expected customer-dependent cost price of a financial product is relatively the same for all customers that belong to the same territory.…”
Section: Introductionmentioning
confidence: 99%