Fast Approximation Methods for Sales Force Deployment
From MaRDI portal
Recommendations
- Upper and lower bounds for the sales force deployment problem with explicit contiguity constraints
- The sales force sizing problem with multi-period workload assignments, and service time windows
- Approximation and competitive algorithms for single-minded selling problem
- Approximation algorithms for the selling with preference
- Approximation algorithms for dynamic assortment optimization models
- A hierarchical procedure for multi-skilled sales force spatial planning
- scientific article; zbMATH DE number 1728538
- Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
- scientific article; zbMATH DE number 1094827
- A fast algorithm for assortment optimization problems
Cited in
(29)- Heuristic methods for the sectoring arc routing problem
- Continuous approximation models in freight distribution management
- The sales force sizing problem with multi-period workload assignments, and service time windows
- Territory design for sales force sizing
- A location-allocation-improvement heuristic for districting with multiple-activity balancing constraints and \(p\)-median-based dispersion minimization
- Simultaneous node and link districting in transportation networks: model, algorithms and railway application
- A concise guide to existing and emerging vehicle routing problem variants
- Upper and lower bounds for the sales force deployment problem with explicit contiguity constraints
- A dual bounding scheme for a territory design problem
- Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)
- An optimization-based approach for the healthcare districting under uncertainty
- Districting for arc routing
- A multi-criteria police districting problem for the efficient and effective design of patrol sector
- A redistricting problem applied to meter reading in power distribution networks
- Dynamic design of sales territories
- Large-scale pickup and delivery work area design
- Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm
- Call planning in European pharmaceutical sales force management
- New models for commercial territory design
- A hierarchical procedure for multi-skilled sales force spatial planning
- Imposing contiguity constraints in political districting models
- scientific article; zbMATH DE number 5938925 (Why is no real title available?)
- The customer assignment and traveling salespersons problem
- The sales force deployment problem for teams of sales representatives within sales territories
- The geo-graph in practice: creating United States congressional districts from census blocks
- Risk-balanced territory design optimization for a micro finance institution
- Designing delivery districts for the vehicle routing problem with stochastic demands
- A reactive GRASP for a commercial territory design problem with multiple balancing requirements
- Validating vehicle routing zone construction using Monte Carlo simulation
This page was built for publication: Fast Approximation Methods for Sales Force Deployment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3116700)
