Pages that link to "Item:Q3442870"

The following pages link to New heuristic methods for the capacitated multi-facility Weber problem (Q3442870):

Displaying 30 items.

• Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems (Q336701) (← links)
• A projected Weiszfeld algorithm for the box-constrained Weber location problem (Q425491) (← links)
• A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand (Q429526) (← 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)
• The multi-facility min-max Weber problem (Q795710) (← links)
• A perturbation-based heuristic for the capacitated multisource Weber problem (Q864040) (← 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)
• A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations (Q1042058) (← links)
• An optimal method for solving the (generalized) multi-Weber problem (Q1197648) (← links)
• Global optimization algorithm for capacitated multi-facility continuous location-allocation problems (Q1668802) (← 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)
• 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)
• Multi-facility green Weber problem (Q2333139) (← 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)
• (Q3500144) (← links)
• Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem (Q3505940) (← links)
• Hybrid cell selection-based heuristic for capacitated multi-facility weber problem with continuous fixed costs (Q5001438) (← links)
• The capacitated multi-facility location–allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms (Q5172481) (← links)
• Solving a minisum single facility location problem in three regions with different norms (Q6157224) (← links)
• Extensions to the planar \(p\)-median problem (Q6165390) (← links)