Pages that link to "Item:Q1273094"
From MaRDI portal
The following pages link to Accelerating convergence in the Fermat-Weber location problem (Q1273094):
Displaying 16 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)
- Accelerating the convergence in the single-source and multi-source Weber problems (Q428088) (← 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)
- Convex ordered median problem with \(\ell _p\)-norms (Q1013404) (← links)
- Solving probabilistic multi-facility Weber problem by vector quantization (Q1027991) (← links)
- A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations (Q1042058) (← links)
- Single-facility location problems in two regions with \(\ell_{1}\)- and \(\ell_q\)-norms separated by a straight line (Q1750471) (← links)
- Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem (Q1761969) (← links)
- On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\) (Q1942259) (← links)
- On the Weber facility location problem with limited distances and side constraints (Q2448124) (← links)
- New models for locating a moving service facility (Q2500782) (← links)
- A geometric perspective of the Weiszfeld algorithm for solving the Fermat−Weber problem (Q2798126) (← links)
- Convergence of a SOR-Weiszfeld Type Algorithm for Incomplete Data Sets (Q3422787) (← links)
