Proportional and maxmin fairness for the sensor location problem with chance constraints

DOI10.1016/j.dam.2019.03.004zbMath1415.90051OpenAlexW2925952658MaRDI QIDQ2414477

Marcio C. Santos, Michael Poss, Dritan Nace, Hannan Luss

Publication date: 17 May 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.03.004

zbMATH Keywords

equityequitable resource allocationrobust combinatorial optimizationstochastic set covering\(\mathcal{N} P\)-hardness

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

A General Model and Efficient Algorithms for Reliable Facility Location Problem Under Uncertain Disruptions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
• MIP reformulations of the probabilistic set covering problem
• On the lexicographic minimax approach to location problems
• Robust discrete optimization and network flows
• Robust combinatorial optimization with knapsack uncertainty
• Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
• On solving linear programs with the ordered weighted averaging objective.
• Fair optimization and networks: a survey
• Max-min fairness in multi-commodity flows
• Ambiguous chance constrained problems and robust optimization
• Public facility location using dispersion, population, and equity criteria
• Distributionally Robust Convex Optimization
• Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
• Lexicographically Minimum and Maximum Load Linear Programming Problems
• The Probabilistic Set-Covering Problem
• On ordered weighted averaging aggregation operators in multicriteria decisionmaking
• A branch and bound method for stochastic integer problems under probabilistic constraints
• Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
• Location Science
• Algorithms for the set covering problem
• Axiomatic characterization of the Gini coefficient and Lorenz curve orderings.