The following pages link to (Q4229604):
Displaying 50 items.
- A projected Weiszfeld algorithm for the box-constrained Weber location problem (Q425491) (← links)
- On the use of the varignon frame for single facility Weber problems in the presence of convex barriers (Q439364) (← links)
- Transport economies of scale and firm location (Q459402) (← links)
- Algorithms for location problems based on angular distances (Q471721) (← links)
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (Q506441) (← links)
- Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams (Q512990) (← links)
- A local search approximation algorithm for \(k\)-means clustering (Q598232) (← links)
- A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation (Q645558) (← links)
- The projection median of a set of points in \({\mathbb{R}}^{d}\) (Q664356) (← links)
- New bounds on the average distance from the Fermat-Weber center of a planar convex body (Q665992) (← links)
- Facility location models for distribution system design (Q707128) (← links)
- A hyperbolic smoothing approach to the multisource Weber problem (Q740639) (← links)
- Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches (Q887199) (← links)
- A generalized Weiszfeld method for the multi-facility location problem (Q974995) (← links)
- Improved bounds on the average distance to the Fermat-Weber center of a convex object (Q976108) (← links)
- The inverse Fermat-Weber problem (Q976390) (← links)
- Optimizing the location of a production firm (Q993460) (← links)
- On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems (Q1001365) (← links)
- The projection median of a set of points (Q1025289) (← links)
- Single facility collection depots location problem in the plane (Q1025297) (← links)
- Clustering search algorithm for the capacitated centered clustering problem (Q1038295) (← links)
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem (Q1271380) (← links)
- Accelerating convergence in the Fermat-Weber location problem (Q1273094) (← links)
- Locational optimization problems solved through Voronoi diagrams (Q1278720) (← links)
- Semi-obnoxious single facility location in Euclidean space. (Q1422376) (← links)
- A note on convergence in the single facility minisum location problem (Q1608453) (← links)
- The planar multifacility collection depots location problem (Q1628125) (← links)
- The Weber obnoxious facility location model: a big arc small arc approach (Q1651661) (← links)
- On the geometric median of convex, triangular and other polygonal domains (Q1717123) (← links)
- Geometrical aggregation of finite fuzzy sets (Q1726291) (← links)
- Location analysis: a synthesis and survey (Q1776950) (← links)
- Facility location problems with uncertainty on the plane (Q1779686) (← links)
- Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs (Q1993202) (← links)
- An elliptical cover problem in drone delivery network design and its solution algorithms (Q2079395) (← links)
- Single facility siting involving allocation decisions (Q2178111) (← links)
- On the upper bound on the average distance from the Fermat-Weber center of a convex body (Q2230395) (← links)
- Conditional facility location problems with continuous demand and a polygonal barrier (Q2239930) (← links)
- Using the power of ideal solutions: simple proofs of some old and new results in location theory (Q2240676) (← links)
- The obnoxious facilities planar \(p\)-median problem (Q2241906) (← links)
- An extended covering model for flexible discrete and equity location problems (Q2379187) (← links)
- On the Weber facility location problem with limited distances and side constraints (Q2448124) (← links)
- An approach for solving competitive location problems with variable demand using multicore systems (Q2448138) (← links)
- New models for locating a moving service facility (Q2500782) (← links)
- Successive computation of some efficient locations of the Weber problem with barriers (Q2511354) (← links)
- On the Fermat-Weber center of a convex object (Q2571212) (← links)
- Review of obnoxious facilities location problems (Q2669654) (← links)
- A geometric perspective of the Weiszfeld algorithm for solving the Fermat-Weber problem (Q2798126) (← links)
- A New Approach to the Upper Bound on the Average Distance from the Fermat-Weber Center of a Convex Body (Q2867124) (← links)
- The Newton Bracketing Method for Convex Minimization: Convergence Analysis (Q2897275) (← links)
- Improved starting solutions for the planar p-median problem (Q3388942) (← links)
