Facility location problems with uncertainty on the plane

DOI10.1016/j.disopt.2004.12.001zbMath1090.90128OpenAlexW2030028156MaRDI QIDQ1779686

Sergei Bereg, Igor Averbakh

Publication date: 1 June 2005

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2004.12.001

zbMATH Keywords

Facility locationPolynomial algorithmRobust optimization

Mathematics Subject Classification ID

Continuous location (90B85)

Related Items

Minmax regret 1-facility location on uncertain path networks, Efficient algorithms for the minmax regret path center problem with length constraint on trees, Computing the Center of Uncertain Points on Tree Networks, An improved algorithm for the minmax regret path centdian problem on trees, The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights, An improved algorithm for the minmax regret path center problem on trees, The two-center problem of uncertain points on a real line, The \(p\)-center problem under locational uncertainty of demand points, Computing the center of uncertain points on cactus graphs, A capacitated location-allocation model for flood disaster service operations with border crossing passages and probabilistic demand locations, One-dimensional \(k\)-center on uncertain data, Computing the center of uncertain points on tree networks, Largest bounding box, smallest diameter, and related problems on imprecise points, Facility location problems with uncertainty on the plane, Location problems with continuous demand and unreliable facilities: applications of families of incremental Voronoi diagrams, A note on computing the center of uncertain data on the real line, Robust Defibrillator Deployment Under Cardiac Arrest Location Uncertainty via Row-and-Column Generation, Covering uncertain points in a tree, Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities, Minimax regret path location on trees, On the minmax regret path median problem on trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic optimization: The Fermat-Weber location problem
• Combinatorial complexity bounds for arrangements of curves and spheres
• The algebraic degree of geometric optimization problems
• On the ball spanned by balls
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• Algorithms for the robust 1-center problem on a tree
• Minmax regret solutions for minimax optimization problems with uncertainty
• Facility location problems with uncertainty on the plane
• Complexity of robust single facility location problems on networks with uncertain edge lengths.
• Robust Convex Optimization
• The Weighted Euclidean 1-Center Problem
• Generalized Selection and Ranking: Sorted Matrices
• Using Block Norms for Location Modeling
• Linear Programming in Linear Time When the Dimension Is Fixed
• Local convergence in Fermat's problem
• Minmax-regret robust 1-median location on a tree
• Robustness in the Pareto-solutions for the multi-criteria minisum location problem
• Introduction to Stochastic Programming
• Minmax Regret Median Location on a Network Under Uncertainty
• On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
• Robust Optimization of Large-Scale Systems
• On the continuous Weber and k -median problems (extended abstract)
• A note on Fermat's problem
• On the complexity of a class of combinatorial optimization problems with uncertainty