The discrete facility location problem with balanced allocation of customers
From MaRDI portal
Publication:631097
DOI10.1016/j.ejor.2010.10.012zbMath1207.90071OpenAlexW1979287684MaRDI 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
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Related Items (18)
The maximin HAZMAT routing problem ⋮ Equality measures properties for location problems ⋮ Facility location under service level constraints for heterogeneous customers ⋮ Inverse and reverse balanced facility location problems with variable edge lengths on trees ⋮ Integer linear programming models for grid-based light post location problem ⋮ Identifying trade‐offs in equity and efficiency for simultaneously optimizing location and multipriority dispatch of ambulances ⋮ Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities ⋮ The balanced \(p\)-median problem with unitary demand ⋮ The balanced 2-median and 2-maxian problems on a tree ⋮ The reverse selective balance center location problem on trees ⋮ Closest assignment constraints in discrete location problems ⋮ Unnamed Item ⋮ \(k\)-balanced center location problem: a new multi-objective facility location problem ⋮ Balancing the arrival times of users in a two-stage location problem ⋮ A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem ⋮ Inverse single facility location problem on a tree with balancing on the distance of server to clients ⋮ Variable Neighborhood Search for Solving the Balanced Location Problem ⋮ Service allocation equity in location coverage analytics
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
This page was built for publication: The discrete facility location problem with balanced allocation of customers
