Equity models in planar location
From MaRDI portal
Publication:871686
DOI10.1007/s10287-006-0021-0zbMath1140.90031OpenAlexW1966306013MaRDI QIDQ871686
Publication date: 20 March 2007
Published in: Computational Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10287-006-0021-0
Related Items
A note on equity across groups in facility location ⋮ Equitable service by a facility: minimizing the Gini coefficient ⋮ An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width ⋮ The quintile share ratio in location analysis ⋮ Equality measures properties for location problems ⋮ Solving the ordered one-median problem in the plane ⋮ Location of a distribution center for a perishable product ⋮ A kernel search heuristic for a fair facility location problem ⋮ Incorporating waiting time in competitive location models ⋮ The leader-follower location model ⋮ An agent-based framework for modeling and solving location problems ⋮ Directional approach to gradual cover: a maximin objective ⋮ Nash equilibrium sorting genetic algorithm for simultaneous competitive maximal covering location with multiple players ⋮ Identifying trade‐offs in equity and efficiency for simultaneously optimizing location and multipriority dispatch of ambulances ⋮ A directional approach to gradual cover ⋮ Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities ⋮ Analyses of location-price game on networks with stochastic customer behavior and its heuristic algorithm ⋮ The maximin gradual cover location problem ⋮ The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution ⋮ Maximizing the minimum cover probability by emergency facilities ⋮ Restructuring the resident training system for improving the equity of access to primary care ⋮ A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables ⋮ Discretization and resolution of the \((r| X_ p)\)-medianoid problem involving quality criteria. ⋮ On single-source capacitated facility location with cost and fairness objectives ⋮ A GIS-based optimization framework for competitive multi-facility location-routing problem ⋮ A general global optimization approach for solving location problems in the plane ⋮ Directional approach to gradual cover: the continuous case ⋮ Location of retail facilities under conditions of uncertainty ⋮ Continuous location problems and big triangle small triangle: Constructing better bounds ⋮ Big segment small segment global optimization algorithm on networks ⋮ Solving the multiple competitive facilities location problem ⋮ Application of decision analysis techniques to the Weber facility location problem
Cites Work
- Unnamed Item
- Unnamed Item
- Global optimality conditions for nonconvex optimization
- Locating lines and hyperplanes. Theory and algorithms
- Equity measurement in facility location analysis: A review and framework
- An optimal bound for d. c. programs with convex constraints
- Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search.
- Solving the multiple competitive facilities location problem
- A d.c. optimization method for single facility location problems
- Finding the optimal solution to the Huff based competitive location model
- On a local and global search involved in nonconvex optimization problems
- Application of deterministic low-discrepancy sequences in global optimization
- Locating an Undesirable Facility by Generalized Cutting Planes
- A multi-objective heuristic approach for the casualty collection points location problem
- The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
- An algorithm for the Lorenz measure in locational decisions on trees
- LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- The m-Center Problem
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
