Improved algorithms for several network location problems with equality measures.
From MaRDI portal
Publication:1408453
DOI10.1016/S0166-218X(02)00599-1zbMath1033.90011WikidataQ58217317 ScholiaQ58217317MaRDI QIDQ1408453
Arie Tamir, Justo Puerto, Juan A. Mesa
Publication date: 22 September 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items
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, Equality measures properties for location problems, Emergency medical services and beyond: addressing new challenges through a wide literature review, Extensive facility location problems on networks: an updated review, On discrete optimization with ordering, Robust mean absolute deviation problems on networks with linear vertex weights, Revisiting \(k\)-sum optimization, A kernel search heuristic for a fair facility location problem, The multi-facility median problem with Pos/Neg weights on general graphs, Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem, A generalized model of equality measures in network location problems, Continuous location under the effect of `refraction', Balancing the arrival times of users in a two-stage location problem, A short note on locating facilities on a path to minimize load range equity measure, Ordered weighted average optimization in multiobjective spanning tree problem, Range minimization problems in path-facility location on trees, The continuous and discrete path‐variance problems on trees, On single-source capacitated facility location with cost and fairness objectives, A comparison of formulations and solution methods for the minimum-envy location problem, Effectiveness-equity models for facility location problems on tree networks, Extensive facility location problems on networks with equity measures, Fair optimization and networks: a survey, Reliability problems in multiple path-shaped facility location on networks
Cites Work
- Unnamed Item
- Unnamed Item
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- A note on locating a central vertex of a 3-cactus graph
- The complexity of selection and ranking in X+Y and matrices with sorted columns
- Generalized concavity
- Equity measurement in facility location analysis: A review and framework
- Center problems with pos/neg weights on trees
- Heuristics for multiple facility location in a network using the variance criterion
- Mean-Variance Location Problems
- Equity Maximizing Facility Location Schemes
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- New Results on the Complexity of p-Centre Problems
- An algorithm for the Lorenz measure in locational decisions on trees
- Off-Line Maintenance of Planar Configurations
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
- An algorithm for the minimum variance point of a network
- Technical Note—On the Complexity of Some Classes of Location Problems
- The Variance Location Problem on a Network with Continuously distributed demand
- Slowing down sorting networks to obtain faster sorting algorithms
- Locating a Point of Minimum Variance on Triangular Graphs
- The maximum absolute deviation measure in location problems on networks
