A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem

Authors:
Hanif D. Sherali;Sridhar Ramachandran;Seong-in Kim
Affiliations:
-;-;-
Venue:
Discrete Applied Mathematics - Special volume: viewpoints on optimization
Year:
1994

Citing 0
Cited 7

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
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