Pages that link to "Item:Q1765537"

The following pages link to A heuristic method for large-scale multi-facility location problems (Q1765537):

Displaying 17 items.

• Heuristics for a continuous multi-facility location problem with demand regions (Q337660) (← links)
• Accelerating the convergence in the single-source and multi-source Weber problems (Q428088) (← links)
• A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation (Q645558) (← links)
• The Newton bracketing method for the minimization of convex functions subject to affine constraints (Q943833) (← links)
• A generalized Weiszfeld method for the multi-facility location problem (Q974995) (← links)
• An algorithm for generalized constrained multi-source Weber problem with demand substations (Q1728411) (← links)
• On the convergence of the Cooper's algorithm (Q2228419) (← links)
• An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge (Q2307752) (← links)
• A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach (Q2318909) (← links)
• The optimal solution set of the multi-source Weber problem (Q2414188) (← links)
• A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach (Q2463484) (← links)
• An estimation algorithm using distance clustering of data. (Q2467834) (← links)
• Single- and multi-objective defensive location problems on a network (Q2469584) (← links)
• The Newton Bracketing Method for Convex Minimization: Convergence Analysis (Q2897275) (← links)
• Optimization models for the dynamic facility location and allocation problem (Q3533186) (← links)
• A Variational Inequality-Based Location-Allocation Algorithm for Locating Multiple Interactive Facilities (Q6053498) (← links)
• Distributionally robust Weber problem with uncertain demand (Q6175466) (← links)