Location-Allocation Problems
From MaRDI portal
Publication:3850360
DOI10.1287/opre.11.3.331zbMath0113.14201OpenAlexW2056119974MaRDI QIDQ3850360
Publication date: 1963
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.11.3.331
Related Items
A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem, Optimum positioning of moving service facility, A projection method for \(l_ p\) norm location-allocation problems, A comparative performance analysis of evolutionary algorithms on \(k\)-median and facility location problems, The planar multifacility collection depots location problem, On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre, Extensions to the Weber problem, A two-level off-grid electric distribution problem on the continuous space, Geometric optimization and the polynomial hierarchy, A direct solution of allocation problems, Accelerating convergence in minisum location problem with \(\ell p\) norms, Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems, A distance-limited continuous location-allocation problem for spatial planning of decentralized systems, New heuristic algorithms for solving the planar \(p\)-median problem, The Weber obnoxious facility location model: a big arc small arc approach, A new heuristic for solving the \(p\)-median problem in the plane, Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems, Capacitated location allocation problem with stochastic location and fuzzy demand: a hybrid algorithm, Single facility siting involving allocation decisions, Biologically inspired parent selection in genetic algorithms, The Fermat-Weber location problem revisited, Integer linear programming models for grid-based light post location problem, The hub location and routing problem, Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches, The capacitated plant location problem, A voltage drop limited decentralized electric power distribution network, On the efficient solution of nonlinear finite element equations. I, Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem, Prepositioning supplies in preparation for disasters, The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches, 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, The Weber problem revisited, Lexicographic local search and the \(p\)-center problem., A cellular heuristic for the multisource Weber problem., A new bounding method for single facility location models, Emergency rescue location model with uncertain rescue time, A three-stage mathematical model for handling and transporting stochastically generated materials, Self-organizing feature maps for solving location--allocation problems with rectilinear distances., Locational analysis, Geometrical aggregation of finite fuzzy sets, A column generation approach to capacitated \(p\)-median problems, Optimization of competitive facility location for chain stores, On the multicriteria allocation problem, Classical and inverse median location problems under uncertain environment, Sequential location of two facilities: comparing random to optimal location of the first facility, New local searches for solving the multi-source Weber problem, A fuzzy algorithm for continuous capacitated location allocation model with risk consideration, A sequential Bayesian alternative to the classical parallel fuzzy clustering model, An optimal method for solving the (generalized) multi-Weber problem, Solving a two-stage stochastic capacitated location-allocation problem with an improved PSO in emergency logistics, The multiple-robot assembly plan problem, Local convergence in a generalized Fermat-Weber problem, Location and allocation for distribution systems with transshipments and transportion economies of scale, A clustering approach to the planar hub location problem, The multi-facility location-allocation problem with polyhedral barriers, Strategic multi-store opening under financial constraint, A new local search for continuous location problems, Lagrangean relaxation heuristics for the \(p\)-cable-trench problem, New genetic algorithms based approaches to continuous \(p\)-median problem, Weiszfeld's method: old and new results, Integrating design and production planning considerations in multi-bay manufacturing facility layout, Generalized coverage: new developments in covering location models, Rederivation of the fuzzy-possibilistic clustering objective function through Bayesian inference, The inverse Fermat-Weber problem, A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand, A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem, Location analysis: a synthesis and survey, The location-allocation problem of drone base stations, The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods, Continuous allocation problems, Computational experiences with the exchange method. Applied to four commonly used partitioning cluster analysis criteria, Normative location theory: Placement in continuous space, Multi-source facility location-allocation and inventory problem, Optimizing the location of a production firm, Stochastic location-assignment on an interval with sequential arrivals, A family of heuristic solution methods for a class of nonlinear programming problems, A review of transport market modeling using game-theoretic principles, Directional approach to gradual cover: the continuous case, The \(\alpha\)-cost minimization model for capacitated facility location-allocation problem with uncertain demands, On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems, Multi-objective multi-layer congested facility location-allocation problem optimization with Pareto-based meta-heuristics, Allocation search methods for a generalized class of location-allocation problems, An efficient algorithm for facility location in the presence of forbidden regions, Determining dominant wind directions, Heuristic solution of the multisource Weber problem as a \(p\)-median problem, Simultaneous siting and sizing of distribution centers on a plane, The variable radius covering problem, Solving probabilistic multi-facility Weber problem by vector quantization, Approximation of solutions for location problems, Two-stage distributionally robust mixed-integer optimization model for three-level location-allocation problems under uncertain environment, Kohonen maps for solving a class of location-allocation problems, A branch-and-price approach for the continuous multifacility monotone ordered median problem, Heuristic solutions to multi-depot location-routing problems, Integer programming formulations of discrete hub location problems, Approximate formulas of average distances associated with regions and their applications to location problems, A note on convergence in the single facility minisum location problem, A continuous location-allocation problem with zone-dependent fixed cost, The \(K\)-connection location problem in a plane, An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem, LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY, Un algorithme pour résoudre une famille de problèmes de localisation multisources, Location of a distribution center for a perishable product, Fuzzy facility location-allocation problem under the Hurwicz criterion, Locating facilities in three‐dimensional space by convex programming, Multi-criteria decision analysis for efficient location-allocation problem combining DEA and goal programming, Integrated Facility Layout Design and Flow Assignment Problem Under Uncertainty, Two-stage mean-risk stochastic mixed integer optimization model for location-allocation problems under uncertain environment, Exact and approximate heuristics for the rectilinear Weber location problem with a line barrier, Discrete facility location in machine learning, Mean-variance value at risk criterion for solving a \(p\)-median location problem on networks with type-2 intuitionistic fuzzy weights, A directional approach to gradual cover, The generalized Fermat-Torricelli problem in Hilbert spaces, On some novel methods for solving the generalized Fermat-Torricelli problem in Hilbert spaces, Multiperiod transshipment location–allocation problem with flow synchronization under stochastic handling operations, A trajectory based heuristic for the planar \(p\)-median problem, Facility location-allocation problem in random fuzzy environment: using \((\alpha,\beta )\)-cost minimization model under the Hurewicz criterion, Exact and approximate solutions to the multisource weber problem, Extensions to the planar \(p\)-median problem, Local convergence in Fermat's problem, Location of slaughterhouses under economies of scale, A note on Fermat's problem, The capacitated facility location-allocation problem under uncertain environment, Incorporating spatial context into fuzzy-possibilistic clustering using Bayesian inference, Construction Line Algorithms for the Connection Location-Allocation Problem, Dynamic location problems with radial structure of the components of the connecting graph, A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach, Biconvex sets and optimization with biconvex functions: a survey and extensions, Unnamed Item, Stochastic facility location with general long-run costs and convex short-run costs, On solving unreliable planar location problems, Optimization of linear-convex programs, The capacitated multi-facility location–allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms, Location of concentrators in a computer communication network: a stochastic automation search method, Variable neighborhood search: Principles and applications, On the collection depots location problem, A Mathematical Programming Model for Optimizing a Petroleum Network of Pipelines and Depots, On the Fermat—Weber problem with convex cost functions, J-MEANS: A new local search heuristic for minimum sum of squares clustering, Steiner's problem and fagnano's result on the sphere, A geometric perspective of the Weiszfeld algorithm for solving the Fermat−Weber problem, Die Bestimmung des optimalen Standorts eines Auslieferungslagers bei entfernungsabhängiger Nachfrage und nichtlinearen Transportkosten, Solving multiple facilities location problems with separated clusters, Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem, A NEW FORMULATION AND RELAXATION OF THE SIMPLE PLANT LOCATION PROBLEM, Improved starting solutions for the planar p-median problem, A historical perspective on location problems, Using injection points in reformulation local search for solving continuous location problems, The Ring Star Problem: Polyhedral analysis and exact algorithm, Generating good starting solutions for the p-median problem in the plane, Median Problems in Networks, Continuous Center Problems, Heuristics for Location Models, The Weiszfeld Algorithm: Proof, Amendments, and Extensions
