A Bi-Objective Median Location Problem With a Line Barrier

DOI10.1287/OPRE.50.4.670.2857zbMath1163.90620OpenAlexW2154114375MaRDI QIDQ3635129

Margaret M. Wiecek, Kathrin Klamroth

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

Mathematics Subject Classification ID

Continuous location (90B85) Nonlinear programming (90C30)

Related Items (9)

An efficient solution method for Weber problems with barriers based on genetic algorithms ⋮ Median location problem with two probabilistic line barriers: extending the Hooke and Jeeves algorithm ⋮ Exact and approximate heuristics for the rectilinear Weber location problem with a line barrier ⋮ Algebraic properties of location problems with one circular barrier. ⋮ A capacitated location-allocation model for flood disaster service operations with border crossing passages and probabilistic demand locations ⋮ A reduction result for location problems with polyhedral barriers ⋮ Multiple criteria facility location problems: a survey ⋮ The rectilinear distance Weber problem in the presence of a probabilistic line barrier ⋮ Planar location problems with block distance and barriers

This page was built for publication: A Bi-Objective Median Location Problem With a Line Barrier