The following pages link to Location-Allocation Problems (Q3850360):
Displaying 50 items.
- An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem (Q262934) (← links)
- Accelerating convergence in minisum location problem with \(\ell p\) norms (Q336624) (← links)
- Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems (Q336701) (← links)
- New heuristic algorithms for solving the planar \(p\)-median problem (Q337669) (← links)
- A new heuristic for solving the \(p\)-median problem in the plane (Q339602) (← links)
- On the multicriteria allocation problem (Q490242) (← links)
- Sequential location of two facilities: comparing random to optimal location of the first facility (Q512975) (← links)
- New local searches for solving the multi-source Weber problem (Q512988) (← links)
- Strategic multi-store opening under financial constraint (Q531471) (← links)
- New genetic algorithms based approaches to continuous \(p\)-median problem (Q539099) (← links)
- Prepositioning supplies in preparation for disasters (Q621705) (← links)
- The multiple-robot assembly plan problem (Q685191) (← links)
- Local convergence in a generalized Fermat-Weber problem (Q689230) (← links)
- Location and allocation for distribution systems with transshipments and transportion economies of scale (Q689233) (← links)
- A clustering approach to the planar hub location problem (Q689257) (← links)
- Integrating design and production planning considerations in multi-bay manufacturing facility layout (Q703925) (← links)
- A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand (Q709182) (← links)
- Approximate formulas of average distances associated with regions and their applications to location problems (Q810364) (← links)
- A continuous location-allocation problem with zone-dependent fixed cost (Q816411) (← links)
- The \(K\)-connection location problem in a plane (Q816418) (← links)
- Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches (Q887199) (← links)
- A new bounding method for single facility location models (Q920023) (← links)
- A three-stage mathematical model for handling and transporting stochastically generated materials (Q922328) (← links)
- The multi-facility location-allocation problem with polyhedral barriers (Q960384) (← links)
- Generalized coverage: new developments in covering location models (Q976025) (← links)
- The inverse Fermat-Weber problem (Q976390) (← links)
- A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem (Q980366) (← links)
- Multi-source facility location-allocation and inventory problem (Q992677) (← links)
- Optimizing the location of a production firm (Q993460) (← links)
- Stochastic location-assignment on an interval with sequential arrivals (Q993467) (← links)
- On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems (Q1001365) (← links)
- Allocation search methods for a generalized class of location-allocation problems (Q1011223) (← links)
- Simultaneous siting and sizing of distribution centers on a plane (Q1026591) (← links)
- The variable radius covering problem (Q1027534) (← links)
- Solving probabilistic multi-facility Weber problem by vector quantization (Q1027991) (← links)
- Optimum positioning of moving service facility (Q1086130) (← links)
- Geometric optimization and the polynomial hierarchy (Q1102110) (← links)
- On the efficient solution of nonlinear finite element equations. I (Q1136489) (← links)
- Optimal location on a sphere (Q1148106) (← links)
- Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle (Q1148209) (← links)
- The Weber problem revisited (Q1151240) (← links)
- Locational analysis (Q1173002) (← links)
- An optimal method for solving the (generalized) multi-Weber problem (Q1197648) (← links)
- Continuous allocation problems (Q1232969) (← links)
- Computational experiences with the exchange method. Applied to four commonly used partitioning cluster analysis criteria (Q1236403) (← links)
- Normative location theory: Placement in continuous space (Q1237028) (← links)
- A family of heuristic solution methods for a class of nonlinear programming problems (Q1241183) (← links)
- An efficient algorithm for facility location in the presence of forbidden regions (Q1266516) (← links)
- Determining dominant wind directions (Q1268424) (← links)
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem (Q1271380) (← links)
