Pages that link to "Item:Q3635104"

The following pages link to Global Optimization Procedures for the Capacitated Euclidean and <i>l_p</i> Distance Multifacility Location-Allocation Problems (Q3635104):

Displayed 11 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)
• A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation (Q645558) ‎ (← links)
• A review of recent advances in global optimization (Q842710) ‎ (← 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)
• A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations (Q1042058) ‎ (← 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)