The minmax regret gradual covering location problem on a network with incomplete information of demand weights
type: Item
instance of: scholarly article
title: The minmax regret gradual covering location problem on a network with incomplete information of demand weights
zbMATH Open document ID: 1208.90099
author: Oded Berman
author: Jiamin Wang
published in: European Journal of Operational Research
publication date: 2011-01-28T00:00:00Z
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 5842695
zbMATH Keywords: location
zbMATH Keywords: network
zbMATH Keywords: gradual covering location
zbMATH Keywords: minmax regret
zbMATH Keywords: incomplete information
MaRDI profile type: Publication
full work available at URL: j.ejor.2010.08.016
OpenAlex ID: W2111215594
cites work: Minimax regret p-center location on a network with demand uncertainty
cites work: Minmax Regret Median Location on a Network Under Uncertainty
cites work: Algorithms for the robust 1-center problem on a tree
cites work: An improved algorithm for the minmax regret median problem on a tree
cites work: The gradual covering decay location problem on a network.
cites work: The probabilistic 1-maximal covering problem on a network with discrete demand weights
cites work: Robust discrete optimization and network flows
cites work: Minmax-regret robust 1-median location on a tree
cites work: Linear Time Algorithms for Two- and Three-Variable Linear Programs
cites work: Uncertainty and Imprecision: Modelling and Analysis
cites work: Robust discrete optimization and its applications
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: Q5832743
cites work: Q3147666
cites work: Uncertainty and rank order in the analytic hierarchy process
cites work: The Theory of Statistical Decision
cites work: The theory of interval-probability as a unifying concept for uncertainty
DOI: 10.1016/J.EJOR.2010.08.016
description: scientific article; zbMATH DE number 5842695