The following pages link to (Q4229629):
Displaying 15 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)
- 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)
- 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)
- Accelerating convergence in the Fermat-Weber location problem (Q1273094) (← links)
- Location and layout planning. A survey (Q1372765) (← links)
- A generalization of the rectangular bounding method for continuous location models (Q1609171) (← links)
- Application of decision analysis techniques to the Weber facility location problem (Q1610127) (← 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)
- Minisum location in space with restriction to curves and surfaces (Q2746395) (← links)
