Minmax Regret Median Location on a Network Under Uncertainty
From MaRDI portal
Publication:4427324
DOI10.1287/ijoc.12.2.104.11897zbMath1034.90007OpenAlexW2008959214MaRDI QIDQ4427324
Publication date: 2000
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.12.2.104.11897
Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)
Related Items
A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint, Minmax regret 1-facility location on uncertain path networks, Efficient algorithms for the minmax regret path center problem with length constraint on trees, A quadratic time exact algorithm for continuous connected 2-facility location problem in trees, Robust facility location problem for hazardous waste transportation, A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty, Minmax regret location--allocation problem on a network under uncertainty, Robust mean absolute deviation problems on networks with linear vertex weights, An improved algorithm for the minmax regret path centdian problem on trees, Minmax regret maximal covering location problems with edge demands, Competitive facility location under attrition, Robust Algorithms for TSP and Steiner Tree, Universal Algorithms for Clustering Problems, The minmax regret gradual covering location problem on a network with incomplete information of demand weights, Location Science in Canada, Robust maximum capture facility location under random utility maximization models, An improved algorithm for the minmax regret path center problem on trees, A distributionally robust optimization approach for two-stage facility location problems, Emergency rescue location model with uncertain rescue time, An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree, A linear time algorithm for computing minmax regret 1-median on a tree network, Lexicographicα-robustness: an application to the 1-median problem, Robust location problems with pos/neg weights on a tree, Facility location problems with uncertainty on the plane, The backup 2‐center and backup 2‐median problems on trees, Capacitated multi-period maximal covering location problem with server uncertainty, Min-max and min-max regret versions of combinatorial optimization problems: A survey, Complexity of robust single facility location problems on networks with uncertain edge lengths., Minimax regret path location on trees, Minmax regret solutions for minimax optimization problems with uncertainty, On the minmax regret path median problem on trees
