The Weber obnoxious facility location model: a big arc small arc approach
From MaRDI portal
Publication:1651661
DOI10.1016/j.cor.2018.06.006zbMath1391.90369OpenAlexW2806374535MaRDI QIDQ1651661
Anita Schöbel, Tammy Drezner, Zvi Drezner
Publication date: 12 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.06.006
Related Items
The planar multifacility collection depots location problem, Extensions to the Weber problem, Single facility siting involving allocation decisions, Review of obnoxious facilities location problems, Location Problems with Cutoff, Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming, The obnoxious competitive facility location model, Extensions to the planar \(p\)-median problem, The obnoxious facilities planar \(p\)-median problem, The minimal covering location and sizing problem in the presence of gradual cooperative coverage
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem
- The big cube small cube solution method for multidimensional facility location problems
- On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
- Location of a facility minimizing nuisance to or from a planar network
- On the point for which the sum of the distances to \(n\) given points is minimum
- Locating a minisum circle in the plane
- Analytical models for locating undesirable facilities
- GBSSS: The generalized big square small square method for planar single- facility location
- Median hyperplanes in normed spaces -- a survey
- Locating lines and hyperplanes. Theory and algorithms
- The obnoxious \(p\) facility network location problem with facility interaction
- A note on center problems with forbidden polyhedra
- An efficient genetic algorithm for the \(p\)-median problem
- Conditional median: a parametric solution concept for location problems
- On the conditional \(p\)-median problem
- The minimum weighted covering location problem with distance constraints
- Big segment small segment global optimization algorithm on networks
- Technical Note—Conditional Location Problems on Networks
- The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
- Location of Multiple Obnoxious Facilities
- Location-Allocation Problems
- Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
- The Centers and Medians of a Graph
- Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
- Heuristic Methods for Location-Allocation Problems
- Location Science
- Competitive Location Models: A Framework and Bibliography
- The multifacility maximin planar location problem with facility interaction
- The Location of Undesirable Facilities
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Location of facilities with rectangular distances among point and area destinations
- Modelling Inter-city Road Distances by Mathematical Functions
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- On the circle closest to a set of points
