scientific article; zbMATH DE number 1253040
From MaRDI portal
Publication:4229604
zbMath0923.90110MaRDI QIDQ4229604
Publication date: 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (59)
Asymmetric distance location model ⋮ The planar multifacility collection depots location problem ⋮ The Newton Bracketing Method for Convex Minimization: Convergence Analysis ⋮ An extended covering model for flexible discrete and equity location problems ⋮ The Weber obnoxious facility location model: a big arc small arc approach ⋮ A local search approximation algorithm for \(k\)-means clustering ⋮ Single facility siting involving allocation decisions ⋮ Review of obnoxious facilities location problems ⋮ Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches ⋮ Location Science in Canada ⋮ A trajectory based heuristic for the planar \(p\)-median problem ⋮ The obnoxious competitive facility location model ⋮ Solving a minisum single facility location problem in three regions with different norms ⋮ Extensions to the planar \(p\)-median problem ⋮ On queueing-inventory-location problems ⋮ A projected Weiszfeld algorithm for the box-constrained Weber location problem ⋮ On the use of the varignon frame for single facility Weber problems in the presence of convex barriers ⋮ A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation ⋮ Semi-obnoxious single facility location in Euclidean space. ⋮ On the geometric median of convex, triangular and other polygonal domains ⋮ Transport economies of scale and firm location ⋮ On the Weber facility location problem with limited distances and side constraints ⋮ An approach for solving competitive location problems with variable demand using multicore systems ⋮ Algorithms for location problems based on angular distances ⋮ Geometrical aggregation of finite fuzzy sets ⋮ The projection median of a set of points in \({\mathbb{R}}^{d}\) ⋮ On the upper bound on the average distance from the Fermat-Weber center of a convex body ⋮ New bounds on the average distance from the Fermat-Weber center of a planar convex body ⋮ Conditional facility location problems with continuous demand and a polygonal barrier ⋮ Using the power of ideal solutions: simple proofs of some old and new results in location theory ⋮ Bounds tightening based on optimality conditions for nonconvex box-constrained optimization ⋮ Unnamed Item ⋮ The obnoxious facilities planar \(p\)-median problem ⋮ Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams ⋮ Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs ⋮ A generalized Weiszfeld method for the multi-facility location problem ⋮ Improved bounds on the average distance to the Fermat-Weber center of a convex object ⋮ Facility location models for distribution system design ⋮ The inverse Fermat-Weber problem ⋮ Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game ⋮ Location analysis: a synthesis and survey ⋮ Facility location problems with uncertainty on the plane ⋮ New models for locating a moving service facility ⋮ Optimizing the location of a production firm ⋮ A geometric perspective of the Weiszfeld algorithm for solving the Fermat−Weber problem ⋮ Successive computation of some efficient locations of the Weber problem with barriers ⋮ On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems ⋮ A hyperbolic smoothing approach to the multisource Weber problem ⋮ Improved starting solutions for the planar p-median problem ⋮ Heuristic solution of the multisource Weber problem as a \(p\)-median problem ⋮ Accelerating convergence in the Fermat-Weber location problem ⋮ The projection median of a set of points ⋮ Single facility collection depots location problem in the plane ⋮ Locational optimization problems solved through Voronoi diagrams ⋮ Clustering search algorithm for the capacitated centered clustering problem ⋮ An elliptical cover problem in drone delivery network design and its solution algorithms ⋮ On the Fermat-Weber center of a convex object ⋮ A New Approach to the Upper Bound on the Average Distance from the Fermat-Weber Center of a Convex Body ⋮ A note on convergence in the single facility minisum location problem
This page was built for publication:
