The pure fixed charge transportation problem (Q3960466): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1002/nav.3800260408
+Normal rank
@@ Property / OpenAlex ID @@
+W1903816159
@@ Property / OpenAlex ID: W1903816159 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-cost transportation problems
@@ Property / cites work: Fixed-cost transportation problems / rank @@
+Normal rank
@@ Property / cites work @@
+Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
+Normal rank
@@ Property / cites work @@
+A Branch Search Algorithm for the Knapsack Problem
+Normal rank
@@ Property / cites work @@
+The fixed charge problem
@@ Property / cites work: The fixed charge problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Group-Theoretic Structure in the Fixed-Charge Transportation Problem
+Normal rank
@@ Property / cites work @@
+A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
+Normal rank
@@ Property / cites work @@
+An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
+Normal rank
@@ Property / cites work @@
+An approximative algorithm for the fixed-charges transportation problem
+Normal rank
@@ Property / cites work @@
+Technical Note—A Vertex Ranking Procedure for Solving the Linear Fixed-Charge Problem
+Normal rank
@@ Property / cites work @@
+Solving the Fixed Charge Problem by Ranking the Extreme Points
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the generalized assignment problem
+Normal rank
@@ Property / cites work @@
+The fixed charge problem
@@ Property / cites work: The fixed charge problem / rank @@
+Normal rank
@@ Property / cites work @@
+A Direct Descent Binary Knapsack Algorithm
@@ Property / cites work: A Direct Descent Binary Knapsack Algorithm / rank @@
+Normal rank