Algorithmic approaches for solving the euclidean distance location and location-allocation problems

Authors:
Intesar Mansour Al-Loughani;Hanif D. Sherali
Affiliations:
-;-
Venue:
Algorithmic approaches for solving the euclidean distance location and location-allocation problems
Year:
1997

Citing 0
Cited 8

Region-rejection based heuristics for the capacitated multi-source Weber problem

Computers and Operations Research
Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations

Computers and Operations Research
A guided reactive GRASP for the capacitated multi-source Weber problem

Computers and Operations Research
Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem

Computers and Operations Research
A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation

Journal of Global Optimization
Single-Source Capacitated Multi-Facility Weber Problem-An iterative two phase heuristic algorithm

Computers and Operations Research
Heuristics for the single source capacitated multi-facility Weber problem

Computers and Industrial Engineering
Beam search heuristics for the single and multi-commodity capacitated Multi-facility Weber Problems

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract