The maximum absolute deviation measure in location problems on networks
From MaRDI portal
Publication:5954836
DOI10.1016/S0377-2217(00)00313-1zbMath1077.90547WikidataQ128017558 ScholiaQ128017558MaRDI QIDQ5954836
M. Cruz López-de-los-Mozos, Juan A. Mesa
Publication date: 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items
Balancing the arrival times of users in a two-stage location problem, Inequality measures and equitable locations, Improved algorithms for several network location problems with equality measures., Equitable aggregations and multiple criteria analysis, On single-source capacitated facility location with cost and fairness objectives, A generalized model of equality measures in network location problems, A kernel search heuristic for a fair facility location problem, Effectiveness-equity models for facility location problems on tree networks
Cites Work
- Unnamed Item
- Finding the upper envelope of n line segments in O(n log n) time
- A note on locating a central vertex of a 3-cactus graph
- Some dynamic computational geometry problems
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- Planar realizations of nonlinear Davenport-Schinzel sequences by segments
- Equity measurement in facility location analysis: A review and framework
- Mean-Variance Location Problems
- Equity Maximizing Facility Location Schemes
- State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
- State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
- An algorithm for the Lorenz measure in locational decisions on trees
- An Overview of Representative Problems in Location Research
- An algorithm for the minimum variance point of a network
- Technical Note—On the Complexity of Some Classes of Location Problems
- Locating a Point of Minimum Variance on Triangular Graphs
