scientific article; zbMATH DE number 1253040
From MaRDI portal
Publication:4229604
zbMATH Open0923.90110MaRDI QIDQ4229604FDOQ4229604
Authors: George O. Wesolowsky 
Publication date: 1993
Title of this publication is not available (Why is that?)
Recommendations
Cited In (62)
- The obnoxious competitive facility location model
- Solving a minisum single facility location problem in three regions with different norms
- Weber's theory of the kernleiter
- On queueing-inventory-location problems
- Title not available (Why is that?)
- Location Science in Canada
- A trajectory based heuristic for the planar \(p\)-median problem
- New models for locating a moving service facility
- Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs
- Clustering search algorithm for the capacitated centered clustering problem
- The Newton bracketing method for convex minimization: convergence analysis
- Asymmetric distance location model
- A new approach to the upper bound on the average distance from the Fermat-Weber center of a convex body
- Facility location models for distribution system design
- A generalized Weiszfeld method for the multi-facility location problem
- Extensions to the planar \(p\)-median problem
- Optimizing the location of a production firm
- A projected Weiszfeld algorithm for the box-constrained Weber location problem
- On the upper bound on the average distance from the Fermat-Weber center of a convex body
- The Weber obnoxious facility location model: a big arc small arc approach
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- Locational optimization problems solved through Voronoi diagrams
- 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
- The obnoxious facilities planar \(p\)-median problem
- Single facility collection depots location problem in the plane
- Successive computation of some efficient locations of the Weber problem with barriers
- Title not available (Why is that?)
- On the use of the varignon frame for single facility Weber problems in the presence of convex barriers
- A local search approximation algorithm for \(k\)-means clustering
- Review of obnoxious facilities location problems
- A hyperbolic smoothing approach to the multisource Weber problem
- Geometrical aggregation of finite fuzzy sets
- Single facility siting involving allocation decisions
- Transport economies of scale and firm location
- Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches
- Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game
- An approach for solving competitive location problems with variable demand using multicore systems
- The inverse Fermat-Weber problem
- A geometric perspective of the Weiszfeld algorithm for solving the Fermat-Weber problem
- Algorithms for location problems based on angular distances
- A historical perspective on location problems
- Location analysis: a synthesis and survey
- Facility location problems with uncertainty on the plane
- The projection median of a set of points
- On the Weber facility location problem with limited distances and side constraints
- Semi-obnoxious single facility location in Euclidean space.
- On the Fermat-Weber center of a convex object
- A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation
- Accelerating convergence in the Fermat-Weber location problem
- Improved starting solutions for the planar \(p\)-median problem
- A note on convergence in the single facility minisum location problem
- An elliptical cover problem in drone delivery network design and its solution algorithms
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
- Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams
- On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems
- An extended covering model for flexible discrete and equity location problems
- The projection median of a set of points in \({\mathbb{R}}^{d}\)
- New bounds on the average distance from the Fermat-Weber center of a planar convex body
- On the geometric median of convex, triangular and other polygonal domains
- Improved bounds on the average distance to the Fermat-Weber center of a convex object
- The planar multifacility collection depots location problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4229604)
