A capacitated facility location problem with constrained backlogging probabilities (Q5428725): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207540600823195
+Normal rank
@@ Property / OpenAlex ID @@
+W2063834841
@@ Property / OpenAlex ID: W2063834841 / rank @@
+Normal rank
@@ Property / cites work @@
+Integer Programming: Methods, Uses, Computations
@@ Property / cites work: Integer Programming: Methods, Uses, Computations / rank @@
+Normal rank
@@ Property / cites work @@
+A heuristic lagrangean algorithm for the capacitated plant location problem
+Normal rank
@@ Property / cites work @@
+Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
+Normal rank
@@ Property / cites work @@
+An algorithm for solving large capacitated warehouse location problems
+Normal rank
@@ Property / cites work @@
+Lagrangean heuristics for location problems
@@ Property / cites work: Lagrangean heuristics for location problems / rank @@
+Normal rank
@@ Property / cites work @@
+A comparison of heuristics and relaxations for the capacitated plant location problem
+Normal rank
@@ Property / cites work @@
+Upper and lower bounds for the single source capacitated location problem.
+Normal rank
@@ Property / cites work @@
+Exact solution methods for uncapacitated location problems with convex transportation costs
+Normal rank
@@ Property / cites work @@
+Heuristics for the capacitated plant location model
+Normal rank
@@ Property / cites work @@
+The simple plant location problem: Survey and synthesis
+Normal rank
@@ Property / cites work @@
+Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
+Normal rank
@@ Property / cites work @@
+An Analysis of Private and Public Sector Location Models
+Normal rank
@@ Property / cites work @@
+The capacitated plant location problem
@@ Property / cites work: The capacitated plant location problem / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
+Normal rank