Pages that link to "Item:Q3505940"

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

Displaying 30 items.

• Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems (Q336701) (← links)
• Heuristics for a continuous multi-facility location problem with demand regions (Q337660) (← 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)
• A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation (Q645558) (← links)
• A perturbation-based heuristic for the capacitated multisource Weber problem (Q864040) (← links)
• A generalized Weiszfeld method for the multi-facility location problem (Q974995) (← 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)
• Solving probabilistic multi-facility Weber problem by vector quantization (Q1027991) (← links)
• Clustering search algorithm for the capacitated centered clustering problem (Q1038295) (← links)
• A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations (Q1042058) (← 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)
• Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm (Q1762137) (← links)
• The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods (Q2022209) (← 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)
• On the Weber facility location problem with limited distances and side constraints (Q2448124) (← links)
• Exact and approximate heuristics for the rectilinear Weber location problem with a line barrier (Q2668733) (← links)
• Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps (Q3369253) (← links)
• New heuristic methods for the capacitated multi-facility Weber problem (Q3442870) (← links)
• Global Optimization Procedures for the Capacitated Euclidean and <i>l_p</i> Distance Multifacility Location-Allocation Problems (Q3635104) (← links)
• Hybrid cell selection-based heuristic for capacitated multi-facility weber problem with continuous fixed costs (Q5001438) (← links)
• BILINEAR PROGRAMMING FORMULATIONS FOR WEBER PROBLEMS WITH CONTINUOUS AND NETWORK DISTANCES (Q5694062) (← links)
• (Q5859893) (← links)
• (Q5859923) (← links)