A discrete EOQ problem is solvable in \(O(\log n)\) time (Q2482773): Difference between revisions

@@ Property / cites work @@
+Rounding procedures for the discrete version of the capacitated economic order quantity problem
+Normal rank
@@ Property / cites work @@
+Continuous and Discrete Shipping Strategies for the Single Link Problem
+Normal rank
@@ Property / cites work @@
+Improved rounding procedures for the discrete version of the capacitated EOQ problem
+Normal rank
@@ Property / cites work @@
+The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications
+Normal rank
@@ Property / cites work @@
+Minimizing Transportation and Inventory Costs for Several Products on a Single Link
+Normal rank
@@ Property / cites work @@
+Global optimization
@@ Property / cites work: Global optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Q5358751
@@ Property / cites work: Q5358751 / rank @@
+Normal rank