A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution
From MaRDI portal
Publication:2178337
DOI10.1007/S10479-017-2742-6zbMATH Open1443.90253OpenAlexW2780610894MaRDI QIDQ2178337FDOQ2178337
Wilfredo F. Yushimito, Sebastián Moreno, Jordi Pereira
Publication date: 11 May 2020
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-017-2742-6
Cites Work
- Title not available (Why is that?)
- A tabu search heuristic and adaptive memory procedure for political districting
- An optimization based heuristic for political districting
- Least squares quantization in PCM
- Branch-and-price: Column generation for solving huge integer programs
- Mixed Integer Programming: Analyzing 12 Years of Progress
- Algorithms for the set covering problem
- Political districting: from classical models to recent approaches
- Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
- Computational Geometry in C
- Operational estimators for the length of a traveling salesman tour
- Multiobjective scatter search for a commercial territory design problem
- Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks
- Multiple criteria districting problemsthe public transportation network pricing system of the Paris region
- A multiplicatively-weighted Voronoi diagram approach to logistics districting
- Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)
- A distribution-free TSP tour length estimation model for random graphs
- 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
- Large-scale pickup and delivery work area design
- School redistricting: embedding GIS tools with integer programming
- A reactive GRASP for a commercial territory design problem with multiple balancing requirements
- Solving a large scale districting problem: A case report
- Local search algorithms for political districting
- Dynamic design of sales territories
- The robust set covering problem with interval data
- Optimal Political Districting by Implicit Enumeration Techniques
- The arc partitioning problem
- The capacitated centred clustering problem
- Districting for Arc Routing
- Clustering search algorithm for the capacitated centered clustering problem
- New models for commercial territory design
- Location Science
- A continuous approach to the design of physical distribution systems
- A novel model for arc territory design: promoting Eulerian districts
- An Asymptotic, Probabilistic Analysis of a Routing Problem
- Designing multi-vehicle delivery tours in a grid-cell format
- Asymptotic expected performance of some TSP heuristics: An empirical evaluation
Cited In (1)
Uses Software
This page was built for publication: A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2178337)
