Exact and approximate solutions to the multisource weber problem (Q5657909): Difference between revisions

@@ Property / cites work @@
+An Application of Dynamic Programming to Location—Allocation Problems
+Normal rank
@@ Property / cites work @@
+Location-Allocation Problems
@@ Property / cites work: Location-Allocation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic Methods for Location-Allocation Problems
+Normal rank
@@ Property / cites work @@
+The Depot Siting Problem with Discontinuous Delivery Cost<sup>†</sup>
+Normal rank
@@ Property / cites work @@
+Branch-and-Bound Methods: A Survey
@@ Property / cites work: Branch-and-Bound Methods: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Branch-and-Bound Methods: General Formulation and Properties
+Normal rank
@@ Property / cites work @@
+Seven Kinds of Convexity
@@ Property / cites work: Seven Kinds of Convexity / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01584989
+Normal rank
@@ Property / OpenAlex ID @@
+W2003529684
@@ Property / OpenAlex ID: W2003529684 / rank @@
+Normal rank