The discrete facility location problem with balanced allocation of customers
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 6006831
- The plant location problem with discrete capacities and indivisible customers
- Solving the competitive discretionary service facility location problem
- Improving solution of discrete competitive facility location problems
- Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations
- Discrete competitive facility location: modeling and optimization approaches
- Exact approaches for competitive facility location with discrete attractiveness
- Competitive facility location problem. An algorithm for the problem concerning the existence of multi-type customers
- Probabilistic location problems with discrete demand weights
Cites work
- A comparison of formulations and solution methods for the minimum-envy location problem
- A flexible model and efficient solution strategies for discrete location problems
- An extended covering model for flexible discrete and equity location problems
- Discrete location for bundled demand points
- Equitable service by a facility: minimizing the Gini coefficient
- Equity Maximizing Facility Location Schemes
- Equity measurement in facility location analysis: A review and framework
- scientific article; zbMATH DE number 9247 (Why is no real title available?)
- scientific article; zbMATH DE number 1253048 (Why is no real title available?)
- Lagrangean bounds for the optimum communication spanning tree problem
- Optimal location with equitable loads
- Outcomes of voting and planning in single facility location problems
- Sequential location problems
- Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case
- The ordered capacitated facility location problem
- Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)
Cited in
(22)- The plant location problem with discrete capacities and indivisible customers
- k-balanced center location problem: a new multi-objective facility location problem
- Competitive facility location problem. An algorithm for the problem concerning the existence of multi-type customers
- Integer linear programming models for grid-based light post 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
- Service allocation equity in location coverage analytics
- Facility location under service level constraints for heterogeneous customers
- Equality measures properties for location problems
- Inverse and reverse balanced facility location problems with variable edge lengths on trees
- The balanced 2-median and 2-maxian problems on a tree
- Variable neighborhood search for solving the balanced location problem
- The maximin HAZMAT routing problem
- The branch and cut method for the facility location problem with client's preferences
- Closest assignment constraints in discrete location problems
- Balancing the arrival times of users in a two-stage 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
- scientific article; zbMATH DE number 7709522 (Why is no real title available?)
- The balanced \(p\)-median problem with unitary demand
- The reverse selective balance center location problem on trees
- Balancing the cardinality of clusters with a distance constraint: a fast algorithm
This page was built for publication: The discrete facility location problem with balanced allocation of customers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q631097)
