Pages that link to "Item:Q1924059"

The following pages link to The Fermat-Weber location problem revisited (Q1924059):

Displaying 34 items.

• On Newton's method for the Fermat-Weber location problem (Q306303) (← links)
• Accelerating convergence in minisum location problem with \(\ell p\) norms (Q336624) (← links)
• A projected Weiszfeld algorithm for the box-constrained Weber location problem (Q425491) (← links)
• Voting with rubber bands, weights, and strings (Q449038) (← links)
• Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms (Q457226) (← links)
• Continuous location under the effect of `refraction' (Q507312) (← links)
• Algebraic optimization: The Fermat-Weber location problem (Q584057) (← links)
• Noniterative solution of some Fermat-Weber location problems (Q666407) (← links)
• Local convergence in a generalized Fermat-Weber problem (Q689230) (← links)
• The big cube small cube solution method for multidimensional facility location problems (Q733529) (← links)
• A continuous analysis framework for the solution of location-allocation problems with dense demand (Q733530) (← links)
• The Fermat-Weber location problem in single integrator dynamics using only local bearing angles (Q894337) (← links)
• On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems (Q1001365) (← links)
• On the convergence of the generalized Weiszfeld algorithm (Q1026601) (← links)
• Accelerating convergence in the Fermat-Weber location problem (Q1273094) (← links)
• A variable-penalty alternating directions method for convex optimization (Q1290650) (← links)
• On the convergence of the Weiszfeld algorithm (Q1396220) (← links)
• The replica location problem and Chebyshev polynomials of the second kind (Q1396694) (← links)
• A note on convergence in the single facility minisum location problem (Q1608453) (← links)
• Local convexity results in a generalized Fermat-Weber problem (Q1806490) (← links)
• Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem (Q1825115) (← links)
• On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\) (Q1942259) (← links)
• A branch-and-price approach for the continuous multifacility monotone ordered median problem (Q2106721) (← links)
• Weiszfeld's method: old and new results (Q2260646) (← links)
• Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem (Q2301135) (← links)
• Minimizing differences of convex functions with applications to facility location and clustering (Q2401517) (← links)
• A subgradient method with non-monotone line search (Q2696908) (← links)
• A geometric perspective of the Weiszfeld algorithm for solving the Fermat-Weber problem (Q2798126) (← links)
• A heuristic algorithm for constrain single-source problem with constrained customers (Q2834045) (← links)
• A Solution to the Weber Location Problem on the Sphere (Q3677470) (← links)
• The 3‐vertex single source Weber location problem (Q3796938) (← links)
• A note on Fermat's problem (Q5670473) (← links)
• A modified Weiszfeld algorithm for the Fermat-Weber location problem (Q5943081) (← links)
• A boosted DC algorithm for non-differentiable DC components with non-monotone line search (Q6568924) (← links)