Constructive heuristics for the uncapacitated continuous location-allocation problem
From MaRDI portal
Publication:4658472
Recommendations
- Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations
- scientific article; zbMATH DE number 5501651
- Heuristic Methods for Location-Allocation Problems
- Heuristics for a continuous multi-facility location problem with demand regions
- Neighborhood search heuristics for the uncapacitated facility location problem
- The heuristic concentration-integer and its application to a class of location problems
- A Heuristic for the Capacitated Single Allocation Hub Location Problem
- New simple and efficient heuristics for the uncapacitated single allocation hub location problem
- A hybrid heuristic for the uncapacitated hub location problem
Cited in
(19)- A continuous location-allocation problem with zone-dependent fixed cost
- Region-rejection based heuristics for the capacitated multi-source Weber problem
- An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem
- A new local search for continuous location problems
- Simulation and optimization of ant colony optimization algorithm for the stochastic uncapacitated location-allocation problem
- Accelerating the convergence in the single-source and multi-source Weber problems
- A heuristic method to solve the location and machine selection problem in a two-dimensional continuous area
- On the convergence of the Cooper's algorithm
- scientific article; zbMATH DE number 2114492 (Why is no real title available?)
- A hierarchical algorithm for the planar single-facility location routing problem
- A guided reactive GRASP for the capacitated multi-source Weber problem
- A perturbation-based heuristic for the capacitated multisource Weber problem
- A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces
- Self-organizing feature maps for solving location--allocation problems with rectilinear distances.
- A cellular heuristic for the multisource Weber problem.
- A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification
- scientific article; zbMATH DE number 5501651 (Why is no real title available?)
- 2-facility manifold location routing problem
- Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
This page was built for publication: Constructive heuristics for the uncapacitated continuous location-allocation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4658472)
