An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure (Q2492672): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10107-005-0641-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2105262010
@@ Property / OpenAlex ID: W2105262010 / rank @@
+Normal rank
@@ Property / cites work @@
+Note—Performance Bounds for Lot Sizing Heuristics
+Normal rank
@@ Property / cites work @@
+Approximation Methods for the Uncapacitated Dynamic Lot Size Problem
+Normal rank
@@ Property / cites work @@
+Approximation Formulations for the Single-Product Capacitated Lot Size Problem
+Normal rank
@@ Property / cites work @@
+Computational Complexity of the Capacitated Lot Size Problem
+Normal rank
@@ Property / cites work @@
+Deterministic Production Planning: Algorithms and Complexity
+Normal rank
@@ Property / cites work @@
+Improving the complexities of approximation algorithms for optimization problems
+Normal rank
@@ Property / cites work @@
+Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
+Normal rank
@@ Property / cites work @@
+When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
+Normal rank