Pages that link to "Item:Q4527247"
From MaRDI portal
The following pages link to Heuristic Methods for Location-Allocation Problems (Q4527247):
Displaying 50 items.
- An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem (Q262934) (← links)
- Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems (Q336701) (← links)
- Location equilibria for a continuous competitive facility location problem under delivered pricing (Q336785) (← links)
- Heuristics for a continuous multi-facility location problem with demand regions (Q337660) (← 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)
- An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem (Q342496) (← links)
- Continuous location of an assembly station (Q356516) (← links)
- An efficient heuristic algorithm for the capacitated \(p\)-median problem (Q385459) (← links)
- Accelerating the convergence in the single-source and multi-source Weber problems (Q428088) (← links)
- A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand (Q429526) (← 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)
- 2-facility manifold location routing problem (Q526422) (← links)
- Clustering and the perturbed spatial median (Q611736) (← links)
- Prepositioning supplies in preparation for disasters (Q621705) (← links)
- A guided reactive GRASP for the capacitated multi-source Weber problem (Q622155) (← links)
- Solving a continuous local access network design problem with a stabilized central column generation approach (Q635164) (← links)
- A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand (Q709182) (← links)
- A continuous analysis framework for the solution of location-allocation problems with dense demand (Q733530) (← links)
- The \(K\)-connection location problem in a plane (Q816418) (← links)
- A perturbation-based heuristic for the capacitated multisource Weber problem (Q864040) (← links)
- The \(p/q\)-\texttt{ACTIVE} uncapacitated facility location problem: investigation of the solution space and an LP-fitting heuristic (Q869586) (← 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)
- The multi-facility location-allocation problem with polyhedral barriers (Q960384) (← links)
- Spatial point process models for location-allocation problems (Q961747) (← links)
- A generalized Weiszfeld method for the multi-facility location problem (Q974995) (← links)
- Generalized coverage: new developments in covering location models (Q976025) (← links)
- A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem (Q980366) (← links)
- Attraction probabilities in variable neighborhood search (Q989828) (← links)
- Region-rejection based heuristics for the capacitated multi-source Weber problem (Q1000993) (← 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)
- Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations (Q1013385) (← 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)
- Exact and heuristic solutions of the global supply chain problem with transfer pricing (Q1041020) (← links)
- A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations (Q1042058) (← links)
- Heuristics for the capacitated plant location model (Q1051554) (← links)
- Location-allocation on congested networks (Q1078058) (← links)
- The effect of ignoring routes when locating depots (Q1111927) (← links)
- A comparative study of heuristics for a two-level routing-location problem (Q1143306) (← 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)
- Hamiltonian location problems (Q1173005) (← links)
- An optimal method for solving the (generalized) multi-Weber problem (Q1197648) (← 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)
