Upper and lower bounds for the sales force deployment problem with explicit contiguity constraints
From MaRDI portal
Publication:2253998
DOI10.1016/j.ejor.2014.01.061zbMath1304.90033OpenAlexW2058823990MaRDI QIDQ2253998
Publication date: 4 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.01.061
column generationcontiguitysemi-infinite programmingbranch-and-pricelarge scale optimizationsales force deployment
Large-scale problems in mathematical programming (90C06) Transportation, logistics and supply chain management (90B06) Semi-infinite programming (90C34)
Related Items
Imposing Contiguity Constraints in Political Districting Models, Modularity maximization to design contiguous policy zones for pandemic response
Cites Work
- Unnamed Item
- A hierarchical procedure for multi-skilled sales force spatial planning
- On the superiority of pulsing under a concave advertising market potential function
- Optimization models for salesforce compensation
- Stabilized column generation
- Compensation plan for competing salespersons under asymmetric information
- Relevance of functional flexibility for heterogeneous sales response models: a comparison of parametric and semi-nonparametric models
- Sales Territory Alignment: A Review and Model
- Fast Approximation Methods for Sales Force Deployment
- Geo-Graphs: An Efficient Model for Enforcing Contiguity and Hole Constraints in Planar Graph Partitioning
- Selected Topics in Column Generation
- A Primer in Column Generation
- Salespeople's management of customer information: Impact on optimal territory and sales force sizes