Closest assignment constraints in discrete location problems (Q439609): Difference between revisions

@@ Property / cites work @@
+A branch-and-cut method for the obnoxious \(p\)-median problem
+Normal rank
@@ Property / cites work @@
+Optimal location with equitable loads
@@ Property / cites work: Optimal location with equitable loads / rank @@
+Normal rank
@@ Property / cites work @@
+A strengthened formulation for the simple plant location problem with order
+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 @@
+Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
+Normal rank
@@ Property / cites work @@
+Uncapacitated Plant Location Under Alternative Spatial Price Policies
+Normal rank
@@ Property / cites work @@
+The ordered capacitated facility location problem
@@ Property / cites work: The ordered capacitated facility location problem / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification
+Normal rank
@@ Property / cites work @@
+The discrete facility location problem with balanced allocation of customers
+Normal rank
@@ Property / cites work @@
+Formulating logical implications in combinatorial optimisation
+Normal rank
@@ Property / cites work @@
+A bilevel mixed-integer program for critical infrastructure protection planning
+Normal rank
@@ Property / cites work @@
+A hierarchical location model for public facility planning
+Normal rank