A cutting plane algorithm for the capacitated facility location problem (Q842775): Difference between revisions

@@ Property / cites work @@
+Capacitated facility location: Separation algorithms and computational experience
+Normal rank
@@ Property / cites work @@
+Capacitated Facility Location: Valid Inequalities and Facets
+Normal rank
@@ Property / cites work @@
+The volume algorithm: Producing primal solutions with a subgradient method
+Normal rank
@@ Property / cites work @@
+An effective heuristic for large-scale capacitated facility location problems
+Normal rank
@@ Property / cites work @@
+Computational study of large-scale \(p\)-median problems
+Normal rank
@@ Property / cites work @@
+The quickhull algorithm for convex hulls
@@ Property / cites work: The quickhull algorithm for convex hulls / rank @@
+Normal rank
@@ Property / cites work @@
+Lagrangean heuristics for location problems
@@ Property / cites work: Lagrangean heuristics for location problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4263705
@@ Property / cites work: Q4263705 / rank @@
+Normal rank
@@ Property / cites work @@
+A comparison of heuristics and relaxations for the capacitated plant location problem
+Normal rank
@@ Property / cites work @@
+A branch-and-price algorithm for the capacitated facility location problem
+Normal rank
@@ Property / cites work @@
+Q4250157
@@ Property / cites work: Q4250157 / rank @@
+Normal rank
@@ Property / cites work @@
+Valid inequalities and facets of the capacitated plant location problem
+Normal rank
@@ Property / cites work @@
+The 0-1 knapsack problem with a single continuous variable
+Normal rank
@@ Property / cites work @@
+Q4040221
@@ Property / cites work: Q4040221 / rank @@
+Normal rank
@@ Property / cites work @@
+A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
+Normal rank