A comparison of formulations and solution methods for the minimum-envy location problem
From MaRDI portal
Publication:1000990
DOI10.1016/j.cor.2008.06.013zbMath1179.90206arXiv0806.3134OpenAlexW1968369005WikidataQ58217225 ScholiaQ58217225MaRDI QIDQ1000990
Justo Puerto, Alfredo Marín, Antonio M. Rodríguez-Chía, Inmaculada Espejo
Publication date: 12 February 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0806.3134
Related Items
Equality measures properties for location problems, Inequity averse optimization in operational research, Emergency medical services and beyond: addressing new challenges through a wide literature review, On discrete optimization with ordering, Lexicographical order in integer programming, A kernel search heuristic for a fair facility location problem, Identifying trade‐offs in equity and efficiency for simultaneously optimizing location and multipriority dispatch of ambulances, Constraint relaxation for the discrete ordered median problem, Fairness in maximal covering location problems, Dynamically second-preferred \(p\)-center problem, Fix-and-optimize approach for a healthcare facility location/network design problem considering equity and accessibility: a case study, Connected graph partitioning with aggregated and non‐aggregated gap objective functions, The discrete facility location problem with balanced allocation of customers, Balancing the arrival times of users in a two-stage location problem, Recent optimization models and trends in location, relocation, and dispatching of emergency medical vehicles, Ordered weighted average optimization in multiobjective spanning tree problem, Single-allocation ordered median hub location problems, On single-source capacitated facility location with cost and fairness objectives, Effectiveness-equity models for facility location problems on tree networks, A branch-and-price approach for the continuous multifacility monotone ordered median problem
Cites Work
- Unnamed Item
- Unnamed Item
- A branch-and-cut method for the obnoxious \(p\)-median problem
- The \(k\)-centrum shortest path problem
- A flexible model and efficient solution strategies for discrete location problems
- Outcomes of voting and planning in single facility location problems
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
- Sequential location problems
- On finding an envy-free Pareto-optimal division
- Equity measurement in facility location analysis: A review and framework
- Maximin share and minimax envy in fair-division problems.
- Improved algorithms for several network location problems with equality measures.
- Competitive envy-free division
- Minimizing the sum of the \(k\) largest functions in linear time.
- An algorithm for super envy-free cake division
- Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity
- No-envy in queueing problems
- Bidding for envy-freeness: a procedural approach to \(n\)-player fair-division problems
- Groves sealed bid auctions of heterogeneous objects with fair prices
- Strategy-proof assignment with fair compensation
- A strengthened formulation for the simple plant location problem with order
- Equity Maximizing Facility Location Schemes
- Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case
- EFFICIENT STRATEGY PROOF FAIR ALLOCATION ALGORITHMS
- The Sum Of Absolute Differences On A Network: Algorithm And Comparison With Other Equality Measures
