Pages that link to "Item:Q1000993"

The following pages link to Region-rejection based heuristics for the capacitated multi-source Weber problem (Q1000993):

Displaying 15 items.

• On statistical bounds of heuristic solutions to location problems (Q281793) (← links)
• 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)
• 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)
• Confidence in heuristic solutions? (Q746822) (← links)
• A two-echelon joint continuous-discrete location model (Q1683143) (← 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 hierarchical algorithm for the planar single-facility location routing problem (Q1761993) (← links)
• Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs (Q1993202) (← 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)
• A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces (Q2355716) (← links)
• Successive computation of some efficient locations of the Weber problem with barriers (Q2511354) (← links)