Efficient location for a semi-obnoxious facility
From MaRDI portal
Publication:1417713
DOI10.1023/A:1026127430341zbMath1039.90035MaRDI QIDQ1417713
Kazuki Tamura, Yoshiaki Ohsawa
Publication date: 5 January 2004
Published in: Annals of Operations Research (Search for Journal in Brave)
Continuous location (90B85) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (13)
Inequity averse optimization in operational research ⋮ Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem ⋮ Multi-criteria decision analysis for efficient location-allocation problem combining DEA and goal programming ⋮ A triobjective model for locating a public semiobnoxious facility in the plane ⋮ The multicriteria big cube small cube method ⋮ Locating a semi-obnoxious covering facility with repelling polygonal regions ⋮ Dispersion with connectivity in wireless mesh networks ⋮ Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives ⋮ On the ordered anti-Weber problem for any norm in \(\mathbb R^2\) ⋮ Planar expropriation problem with non-rigid rectangular facilities ⋮ Euclidean push--pull partial covering problems ⋮ Low complexity algorithms for optimal consumer push-pull partial covering in the plane ⋮ Efficiency for continuous facility location problems with attraction and repulsion
This page was built for publication: Efficient location for a semi-obnoxious facility
