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

DOI10.1287/OPRE.50.3.433.7739MaRDI QIDQ3635104zbMATH OpenOpenAlexFDO

Authors 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

Discrete location and assignment (90B80) Applications of mathematical programming (90C90)

Recommendations

• A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
• Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
• Global optimization algorithm for capacitated multi-facility continuous location-allocation problems
• Technical Note—A Generalized Bounding Method for Multifacility Location Models
• Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem

Cited in

(15)

• 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
• A model for the capacitated p-facility location problem in global environments
• 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
• scientific article; zbMATH DE number 5986298 (Why is no real title available?)
• Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems
• A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand
• 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

This page was built for publication: Global Optimization Procedures for the Capacitated Euclidean and l_p Distance Multifacility Location-Allocation Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3635104)