Pages that link to "Item:Q1765537"

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

Displaying 34 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 big cube small cube solution method for multidimensional facility location problems (Q733529) (← 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)
• A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations (Q1042058) (← links)
• An effective heuristic for large-scale capacitated facility location problems (Q1044245) (← links)
• Solving multifacility Huff location models on networks using metaheuristic and exact approaches (Q1652125) (← 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)
• Solving multiple facilities location problems with separated clusters (Q2294344) (← 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)
• Linear relaxation solution based heuristics for a class of multi-product facility location problems (Q3307333) (← links)
• (Q3318494) (← links)
• Heuristic cluster algorithm for multiple facility location-allocation problem (Q3348692) (← links)
• Optimization models for the dynamic facility location and allocation problem (Q3533186) (← links)
• A heuristic approach to the single facility maximin location problem (Q3696815) (← links)
• Acceleration of the HAP approach for the multifacility location problem (Q3703610) (← links)
• Heuristic Solution Methods for Two Location Problems with Unreliable Facilities (Q3754406) (← links)
• A Lagrangean heuristic for the plant location problem with multiple facilities in the same site (Q4405938) (← links)
• Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning (Q5111126) (← links)
• Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands (Q5131702) (← links)
• Metaheuristic approaches to solving large-scale Bilevel Uncapacitated Facility Location Problem with clients' preferences (Q5278852) (← links)
• AI 2005: Advances in Artificial Intelligence (Q5898080) (← links)
• A Multicriteria Districting Heuristic For The Aggregation Of Zones And Its Use In Computing Origin-Destination Matrices (Q6039357) (← links)
• A Variational Inequality-Based Location-Allocation Algorithm for Locating Multiple Interactive Facilities (Q6053498) (← links)
• Distributionally robust Weber problem with uncertain demand (Q6175466) (← links)