Computational complexity of the discrete competitive facility location problem (Q5264752): Difference between revisions

@@ Property / cites work @@
+Q3115693
@@ Property / cites work: Q3115693 / rank @@
+Normal rank
@@ Property / cites work @@
+Local search algorithms for the problem of competitive location of enterprises
+Normal rank
@@ Property / cites work @@
+Q3115272
@@ Property / cites work: Q3115272 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3115237
@@ Property / cites work: Q3115237 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3115726
@@ Property / cites work: Q3115726 / rank @@
+Normal rank
@@ Property / cites work @@
+New lower bounds for the facility location problem with clients’ preferences
+Normal rank
@@ Property / cites work @@
+Q3710341
@@ Property / cites work: Q3710341 / rank @@
+Normal rank
@@ Property / cites work @@
+Competitive facility location models
@@ Property / cites work: Competitive facility location models / rank @@
+Normal rank
@@ Property / cites work @@
+Branch-and-bound algorithm for a competitive facility location problem
+Normal rank
@@ Property / cites work @@
+A strengthened formulation for the simple plant location problem with order
+Normal rank
@@ Property / cites work @@
+On the complexity of the \((r|p)\)-centroid problem in the plane
+Normal rank
@@ Property / cites work @@
+Foundations of bilevel programming
@@ Property / cites work: Foundations of bilevel programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The simple plant location problem: Survey and synthesis
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1134/s1990478914040139
+Normal rank
@@ Property / OpenAlex ID @@
+W1974407940
@@ Property / OpenAlex ID: W1974407940 / rank @@
+Normal rank