New heuristic methods for the capacitated multi-facility Weber problem
From MaRDI portal
Recommendations
- Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
- scientific article; zbMATH DE number 5282971
- Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
- Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
- A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations
Cited in
(31)- Region-rejection based heuristics for the capacitated multi-source Weber problem
- Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations
- Solving probabilistic multi-facility Weber problem by vector quantization
- A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations
- An optimal method for solving the (generalized) multi-Weber problem
- Global optimization algorithm for capacitated multi-facility continuous location-allocation problems
- The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches
- Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
- Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
- The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods
- A new local search for continuous location problems
- The location-allocation problem of drone base stations
- The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem
- Multi-facility green Weber problem
- Exact and approximate heuristics for the rectilinear Weber location problem with a line barrier
- Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems
- Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps
- scientific article; zbMATH DE number 5282971 (Why is no real title available?)
- Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
- A projected Weiszfeld algorithm for the box-constrained Weber location problem
- A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
- Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
- Hybrid cell selection-based heuristic for capacitated multi-facility weber problem with continuous fixed costs
- The capacitated multi-facility location–allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms
- Solving a minisum single facility location problem in three regions with different norms
- Extensions to the planar \(p\)-median problem
- A guided reactive GRASP for the capacitated multi-source Weber problem
- A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation
- The intersection of location-allocation, partitional clustering and model-based clustering techniques -- a review
- The multi-facility min-max Weber problem
- A perturbation-based heuristic for the capacitated multisource Weber problem
This page was built for publication: New heuristic methods for the capacitated multi-facility Weber problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3442870)
