Pages that link to "Item:Q4285171"

The following pages link to Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances (Q4285171):

Displaying 30 items.

• Accelerating convergence in minisum location problem with \(\ell p\) norms (Q336624) (← links)
• Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems (Q336701) (← links)
• Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms (Q457226) (← links)
• Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem (Q490197) (← links)
• On solving the planar \(k\)-centrum problem with Euclidean distances (Q613427) (← links)
• A guided reactive GRASP for the capacitated multi-source Weber problem (Q622155) (← links)
• A continuous location-allocation problem with zone-dependent fixed cost (Q816411) (← links)
• Convex ordered median problem with \(\ell _p\)-norms (Q1013404) (← links)
• The single facility location problem with average-distances (Q1024705) (← links)
• On the convergence of the generalized Weiszfeld algorithm (Q1026601) (← links)
• Solving probabilistic multi-facility Weber problem by vector quantization (Q1027991) (← links)
• Extension of the Weiszfeld procedure to a single facility minisum location model with mixed \(\ell_{p}\) norms (Q1040688) (← links)
• A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations (Q1042058) (← 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)
• A note on an ``inverse Weber'' location model (Q1334828) (← links)
• Location and layout planning. A survey (Q1372765) (← links)
• The convergence of the Weiszfeld algorithm (Q1586265) (← links)
• A note on convergence in the single facility minisum location problem (Q1608453) (← links)
• A generalization of the rectangular bounding method for continuous location models (Q1609171) (← links)
• Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem (Q1761969) (← links)
• \(L_q\)-closest-point to affine subspaces using the generalized Weiszfeld algorithm (Q1799963) (← links)
• Local convexity results in a generalized Fermat-Weber problem (Q1806490) (← links)
• The Fermat-Weber location problem revisited (Q1924059) (← links)
• On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\) (Q1942259) (← links)
• Iteratively reweighted least squares and slime mold dynamics: connection and convergence (Q2149565) (← links)
• An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge (Q2307752) (← links)
• A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach (Q2463484) (← links)
• New models for locating a moving service facility (Q2500782) (← links)
• The Weiszfeld Algorithm: Proof, Amendments, and Extensions (Q5506731) (← links)