Global Optimization Procedures for the Capacitated Euclidean and lp Distance Multifacility Location-Allocation Problems

DOI10.1287/opre.50.3.433.7739zbMath1163.90615MaRDI QIDQ3635104

Hanif D. Sherali, Intesar Al-Loughani, Shivaram Subramanian

Publication date: 3 July 2009

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.50.3.433.7739

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90B80: Discrete location and assignment

Related Items

Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems, Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber 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, A review of recent advances in global optimization, 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, A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations, 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, The location-allocation problem of drone base stations