The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation (Q1869670): Difference between revisions

@@ Property / cites work @@
+On locating a semi-desirable facility on the continuous plane
+Normal rank
@@ Property / cites work @@
+An empirical investigation of some bicriterion shortest path algorithms
+Normal rank
@@ Property / cites work @@
+Q4265879
@@ Property / cites work: Q4265879 / rank @@
+Normal rank
@@ Property / cites work @@
+Multicriteria optimization
@@ Property / cites work: Multicriteria optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Analytical models for locating undesirable facilities
+Normal rank
@@ Property / cites work @@
+The Minisum and Minimax Location Problems Revisited
+Normal rank
@@ Property / cites work @@
+Q4383637
@@ Property / cites work: Q4383637 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4203976
@@ Property / cites work: Q4203976 / rank @@
+Normal rank
@@ Property / cites work @@
+GBSSS: The generalized big square small square method for planar single- facility location
+Normal rank
@@ Property / cites work @@
+A label correcting approach for solving bicriterion shortest-path problems
+Normal rank
@@ Property / cites work @@
+Q3815146
@@ Property / cites work: Q3815146 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0377-2217(02)00271-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2006896692
@@ Property / OpenAlex ID: W2006896692 / rank @@
+Normal rank