The discrete facility location problem with balanced allocation of customers
From MaRDI portal
Publication:631097
DOI10.1016/j.ejor.2010.10.012zbMath1207.90071MaRDI QIDQ631097
Publication date: 22 March 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.10.012
90C10: Integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B80: Discrete location and assignment
Related Items
Closest assignment constraints in discrete location problems, Integer linear programming models for grid-based light post location problem
Cites Work
- Unnamed Item
- Unnamed Item
- Lagrangean bounds for the optimum communication spanning tree problem
- The ordered capacitated facility location problem
- Discrete location for bundled demand points
- Equitable service by a facility: minimizing the Gini coefficient
- A comparison of formulations and solution methods for the minimum-envy location problem
- Optimal location with equitable loads
- A flexible model and efficient solution strategies for discrete location problems
- Outcomes of voting and planning in single facility location problems
- Sequential location problems
- Equity measurement in facility location analysis: A review and framework
- An extended covering model for flexible discrete and equity location problems
- Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)
- Equity Maximizing Facility Location Schemes
- Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case