Lower and upper bounds for the continuous single facility location problem in the presence of a forbidden region and travel barrier

DOI10.1051/RO/2020024zbMath1468.90067OpenAlexW3008626940MaRDI QIDQ5001365

Intesar M. al-Mudahka, Rym M'Hallah, Marwa S. al-Jeraiwi

Publication date: 19 July 2021

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

Full work available at URL: https://doi.org/10.1051/ro/2020024

zbMATH Keywords

facility location Euclidean distance reformulation divide and conquer forbidden region nested partitioning

Mathematics Subject Classification ID

Convex programming (90C25) Mixed integer programming (90C11) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Discrete location and assignment (90B80)

This page was built for publication: Lower and upper bounds for the continuous single facility location problem in the presence of a forbidden region and travel barrier