Pages that link to "Item:Q3505940"
From MaRDI portal
The following pages link to Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem (Q3505940):
Displayed 8 items.
- Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem (Q490197) (← links)
- A guided reactive GRASP for the capacitated multi-source Weber problem (Q622155) (← links)
- Region-rejection based heuristics for the capacitated multi-source Weber problem (Q1000993) (← links)
- Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations (Q1013385) (← links)
- Clustering search algorithm for the capacitated centered clustering problem (Q1038295) (← links)
- Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem (Q1761969) (← links)
- A new local search for continuous location problems (Q2255938) (← links)
- Distributions of rectilinear deviation distance to visit a facility (Q2270299) (← links)