Pages that link to "Item:Q490197"

The following pages link to Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem (Q490197):

Displaying 15 items.

• 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)
• A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations (Q1042058) (← links)
• A convergent approximation scheme for efficient sets of the multi-criteria Weber location problem (Q1284597) (← links)
• The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches (Q1695018) (← 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)
• 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)
• On the Weber facility location problem with limited distances and side constraints (Q2448124) (← 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)
• Solving a minisum single facility location problem in three regions with different norms (Q6157224) (← links)