A strengthened formulation for the simple plant location problem with order (Q2643785): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2006.01.012
+Normal rank
@@ Property / OpenAlex ID @@
+W2045648264
@@ Property / OpenAlex ID: W2045648264 / rank @@
+Normal rank
@@ Property / cites work @@
+A branch-and-cut method for the obnoxious \(p\)-median problem
+Normal rank
@@ Property / cites work @@
+On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
+Normal rank
@@ Property / cites work @@
+On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
+Normal rank
@@ Property / cites work @@
+COBRA: A new formulation of the classic \(p\)-median location problem
+Normal rank
@@ Property / cites work @@
+Q4132252
@@ Property / cites work: Q4132252 / rank @@
+Normal rank
@@ Property / cites work @@
+Competitive Location on a Network
@@ Property / cites work: Competitive Location on a Network / rank @@
+Normal rank
@@ Property / cites work @@
+Closest assignment constraints and location models: Properties and structure
+Normal rank
@@ Property / cites work @@
+Branch and peg algorithms for the simple plant location problem
+Normal rank
@@ Property / cites work @@
+A note on duality gap in the simple plant location problem
+Normal rank