A novel reformulation for the single-sink fixed-charge transportation problem (Q6052058): Difference between revisions

@@ Property / DOI @@
-.1007/s10107-023-01930-y
@@ Property / DOI: 10.1007/s10107-023-01930-y / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10107-023-01930-y
+Normal rank
@@ Property / OpenAlex ID @@
+W4320039432
@@ Property / OpenAlex ID: W4320039432 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Single-Sink Fixed Charge Transportation Problems with Applications to Manufacturing and Transportation
+Normal rank
@@ Property / cites work @@
+Algorithms for solving the single-sink fixed-charge transportation problem
+Normal rank
@@ Property / cites work @@
+Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
+Normal rank
@@ Property / cites work @@
+Exact algorithm for solving a special fixed-charge linear programming problem
+Normal rank
@@ Property / cites work @@
+An upper bound for the zero-one knapsack problem and a branch and bound algorithm
+Normal rank
@@ Property / cites work @@
+Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
+Normal rank
@@ Property / cites work @@
+A Minimal Algorithm for the 0-1 Knapsack Problem
@@ Property / cites work: A Minimal Algorithm for the 0-1 Knapsack Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A Minimal Algorithm for the Bounded Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Note. An Acquisition Policy for a Single Item Multi-Supplier System
+Normal rank
@@ Property / cites work @@
+An Algorithm for Large Zero-One Knapsack Problems
@@ Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Where are the hard knapsack problems?
@@ Property / cites work: Where are the hard knapsack problems? / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10107-023-01930-Y
@@ Property / DOI: 10.1007/S10107-023-01930-Y / rank @@
+Normal rank