Pages that link to "Item:Q3505940"

The following pages link to Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem (Q3505940):

Displaying 15 items.

• 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)
• 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)
• The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches (Q1695018) (← 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)
• The location-allocation problem of drone base stations (Q2273669) (← links)
• The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem (Q2327679) (← links)
• Simulation and optimization of ant colony optimization algorithm for the stochastic uncapacitated location-allocation problem (Q2358289) (← links)
• (Q5859893) (← links)
• (Q5859923) (← links)