Pages that link to "Item:Q1924059"

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

Displaying 18 items.

• 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)
• 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)
• Accelerating convergence in the Fermat-Weber location problem (Q1273094) (← links)
• A variable-penalty alternating directions method for convex optimization (Q1290650) (← links)
• A note on convergence in the single facility minisum location problem (Q1608453) (← 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)