Heuristic Methods for Location-Allocation Problems
From MaRDI portal
Publication:4527247
DOI10.1137/1006005zbMath0956.90014WikidataQ124877771 ScholiaQ124877771MaRDI QIDQ4527247
Publication date: 11 March 2001
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1006005
Related Items
Locating facilities in three‐dimensional space by convex programming, Exact and approximate solutions to the multisource weber problem, On solving unreliable planar location problems, On the collection depots location problem, A continuous analysis framework for the solution of location-allocation problems with dense demand, The \(K\)-connection location problem in a plane, A perturbation-based heuristic for the capacitated multisource Weber problem, The \(p/q\)-\texttt{ACTIVE} uncapacitated facility location problem: investigation of the solution space and an LP-fitting heuristic, A new bounding method for single facility location models, The multi-facility location-allocation problem with polyhedral barriers, Spatial point process models for location-allocation problems, A generalized Weiszfeld method for the multi-facility location problem, Generalized coverage: new developments in covering location models, A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem, Attraction probabilities in variable neighborhood search, Region-rejection based heuristics for the capacitated multi-source Weber problem, On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems, Allocation search methods for a generalized class of location-allocation problems, Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations, Simultaneous siting and sizing of distribution centers on a plane, The variable radius covering problem, Solving probabilistic multi-facility Weber problem by vector quantization, Exact and heuristic solutions of the global supply chain problem with transfer pricing, A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations, Heuristics for the capacitated plant location model, Location-allocation on congested networks, The effect of ignoring routes when locating depots, A comparative study of heuristics for a two-level routing-location problem, Optimal location on a sphere, Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle, Hamiltonian location problems, An optimal method for solving the (generalized) multi-Weber problem, Computational experiences with the exchange method. Applied to four commonly used partitioning cluster analysis criteria, Normative location theory: Placement in continuous space, Determining dominant wind directions, Heuristic solution of the multisource Weber problem as a \(p\)-median problem, Kohonen maps for solving a class of location-allocation problems, A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem, A projection method for \(l_ p\) norm location-allocation problems, The hub location and routing problem, A double annealing algorithm for discrete location/allocation problems, A cellular heuristic for the multisource Weber problem., Self-organizing feature maps for solving location--allocation problems with rectilinear distances., Heuristic solutions to multi-depot location-routing problems, A heuristic method for large-scale multi-facility location problems, Approximation of solutions for location problems, A two-phased approach to the supply network reconfiguration problem, A bibliography for some fundamental problem categories in discrete location science, Regional service coverage modeling, A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach, Biconvex sets and optimization with biconvex functions: a survey and extensions, Un algorithme pour résoudre une famille de problèmes de localisation multisources, LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY, Local convergence in Fermat's problem, On the Fermat—Weber problem with convex cost functions
