Facility location problems with uncertainty on the plane
type: Item
instance of: scholarly article
title: Facility location problems with uncertainty on the plane
zbMATH Open document ID: 1090.90128
author: Igor Averbakh
author: Sergei Bereg
published in: Discrete Optimization
publication date: 2005-06-01T00:00:00Z
Mathematics Subject Classification ID: 90B85
zbMATH DE Number: 2173494
zbMATH Keywords: Facility location
zbMATH Keywords: Polynomial algorithm
zbMATH Keywords: Robust optimization
MaRDI profile type: Publication
full work available at URL: j.disopt.2004.12.001
OpenAlex ID: W2030028156
cites work: Q4945501
cites work: Minmax regret solutions for minimax optimization problems with uncertainty
cites work: On the complexity of a class of combinatorial optimization problems with uncertainty
cites work: Complexity of robust single facility location problems on networks with uncertain edge lengths.
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: The algebraic degree of geometric optimization problems
cites work: Robust convex optimization
cites work: Robust discrete optimization and network flows
cites work: Introduction to Stochastic Programming
cites work: Algebraic optimization: The Fermat-Weber location problem
cites work: Minmax-regret robust 1-median location on a tree
cites work: Combinatorial complexity bounds for arrangements of curves and spheres
cites work: On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
cites work: Q3772828
cites work: On the continuous Weber and k -median problems (extended abstract)
cites work: Robustness in the Pareto-solutions for the multi-criteria minisum location problem
cites work: Generalized Selection and Ranking: Sorted Matrices
cites work: Q4309474
cites work: Local convergence in Fermat's problem
cites work: Robust discrete optimization and its applications
cites work: A note on Fermat's problem
cites work: Q4203976
cites work: The Weighted Euclidean 1-Center Problem
cites work: Linear Programming in Linear Time When the Dimension Is Fixed
cites work: On the ball spanned by balls
cites work: Robust Optimization of Large-Scale Systems
cites work: Q3992847
cites work: Q4401009
cites work: Q4239707
cites work: Using Block Norms for Location Modeling
cites work: Q4229604
DOI: 10.1016/J.DISOPT.2004.12.001
description: scientific article; zbMATH DE number 2173494