The minmax regret gradual covering location problem on a network with incomplete information of demand weights

DOI10.1016/j.ejor.2010.08.016zbMath1208.90099MaRDI QIDQ621687

Oded Berman, Jiamin Wang

Publication date: 28 January 2011

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.08.016

zbMATH Keywords

network; minmax regret; location; incomplete information; gradual covering location

Mathematics Subject Classification ID

90B80: Discrete location and assignment

Related Items

A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty, Continuous space maximal coverage: insights, advances and challenges, Scenario based robust line balancing: Computational complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Uncertainty and rank order in the analytic hierarchy process
• Robust discrete optimization and its applications
• The gradual covering decay location problem on a network.
• Robust discrete optimization and network flows
• Algorithms for the robust 1-center problem on a tree
• The theory of interval-probability as a unifying concept for uncertainty
• Linear Time Algorithms for Two- and Three-Variable Linear Programs
• The probabilistic 1-maximal covering problem on a network with discrete demand weights
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Minimax regret p-center location on a network with demand uncertainty
• Minmax Regret Median Location on a Network Under Uncertainty
• An improved algorithm for the minmax regret median problem on a tree
• Uncertainty and Imprecision: Modelling and Analysis
• The Theory of Statistical Decision