The Weber obnoxious facility location model: a big arc small arc approach
type: Item
instance of: scholarly article
title: The Weber obnoxious facility location model: a big arc small arc approach
zbMATH Open document ID: 1391.90369
author: Tammy Drezner
author: Zvi Drezner
author: Anita Schöbel
published in: Computers \& Operations Research
publication date: 2018-07-12T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6902872
describes a project that uses: SITATION
describes a project that uses: MOD-DIST
describes a project that uses: MENU-OKF
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: j.cor.2018.06.006
OpenAlex ID: W2806374535
cites work: An efficient genetic algorithm for the \(p\)-median problem
cites work: Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
cites work: Big segment small segment global optimization algorithm on networks
cites work: The minimum weighted covering location problem with distance constraints
cites work: Technical Note—Conditional Location Problems on Networks
cites work: Locating a minisum circle in the plane
cites work: Q4695785
cites work: Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem
cites work: Location-Allocation Problems
cites work: Heuristic Methods for Location-Allocation Problems
cites work: Q4857376
cites work: Location of a facility minimizing nuisance to or from a planar network
cites work: On the conditional \(p\)-median problem
cites work: Q3147656
cites work: On the circle closest to a set of points
cites work: The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
cites work: Location of Multiple Obnoxious Facilities
cites work: On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
cites work: Competitive Location Models: A Framework and Bibliography
cites work: Analytical models for locating undesirable facilities
cites work: Q4354785
cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
cites work: Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
cites work: Q4865765
cites work: A note on center problems with forbidden polyhedra
cites work: Q4079017
cites work: Optimization by Simulated Annealing
cites work: Location Science
cites work: Modelling Inter-city Road Distances by Mathematical Functions
cites work: Median hyperplanes in normed spaces -- a survey
cites work: The Location of Undesirable Facilities
cites work: The Centers and Medians of a Graph
cites work: Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
cites work: Conditional median: a parametric solution concept for location problems
cites work: Q4484914
cites work: GBSSS: The generalized big square small square method for planar single- facility location
cites work: Locating lines and hyperplanes. Theory and algorithms
cites work: The big cube small cube solution method for multidimensional facility location problems
cites work: On the point for which the sum of the distances to \(n\) given points is minimum
cites work: The obnoxious \(p\) facility network location problem with facility interaction
cites work: The multifacility maximin planar location problem with facility interaction
cites work: Q4229604
cites work: Location of facilities with rectangular distances among point and area destinations
DOI: 10.1016/J.COR.2018.06.006
description: scientific article; zbMATH DE number 6902872