Wagelmans, A.P.M., S. Van Hoesel, and A. Kolen, 1992, "Economic Lot Sizing: An O(n log n)-algorithm that Runs in Linear Time in the Wagner-Whitin Case," Oper. Res ., 40, S145-S156. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Models for Integrated Production Planning and Order Selection - Geunes, Romeijn, Taaffe (Correct)
....tT mmt = the total computational effort of arc cost calculations is bounded by OmT and the shortest path calculation is no worse than O(T ) so the worst case complexity of this algorithm is bounded by OmT . More recent work on the uncapacitated lot sizing problem (e.g. 7] and [18]) has reduced the complexity of the problem from the O(T ) bound to O(T log T) or even O(T) in certain special cases) These approaches, however, rely on an important property that holds for the uncapacitated lot sizing problem (ULSP) This critical property requires that the cumulative ....
Wagelmans, A.P.M., S. Van Hoesel, and A. Kolen, 1992, "Economic Lot Sizing: An O(n log n)-algorithm that Runs in Linear Time in the Wagner-Whitin Case," Oper. Res ., 40, S145-S156.
Improved Complexity Bounds For Location Problems On The Real Line - Hassin, Tamir (1991) (11 citations) (Correct)
.... programming [6,8,15] to improve the complexity bounds of the general model from O(pn 2 ) to O(n 2 ) For the linear cases the p median and the simple plant location models we obtain O(pn) and O(n) bounds, respectively, by implementing the elegant computational geometry approach of [14]. Finally, for the stepwise case the p coverage problem we present a parametric approach which yields a further improvement under additional assumptions. 1. The General Model Let N = fv 1 ; v n g be a set of n points on the real line, identified as the set of demand points. In a ....
....w(j; k) can be obtained in constant time for a fixed pair j k. Therefore (1.3) can be solved in O(pn) time for the linear case. When the constraint jSj p is redundant the bound reduces to O(n) Simpler algorithms with the same bounds can be derived by applying the simple and elegant ideas in [14]. To facilitate the discussion consider for example, the equations in (1.5) Using (2.1) we rewrite (1.5) as G(j) C j Min j kn 1 f GammaAV (j Gamma 1) A(j Gamma 1)v j Gamma A(k Gamma 1)v j AV (k Gamma 1) F (k)g F (j) Min jkn fAV (j Gamma 1) Gamma A(j Gamma 1)v k A(k)v k ....
[Article contains additional citation context not shown here]
A.P.M. Wagelmans, C.P.M. Van Hoesel and A.W.J. Kolen, "Economic lot-sizing: An O(N log N )- algorithm that runs in linear time in the Wagner-Whitin case", Report 8952/A, Erasmus University, Rotterdam, 1989.
Polyhedral Techniques in Combinatorial Optimization I: Theory - Aardal, van Hoesel (1995) (1 citation) Self-citation (Van hoesel) (Correct)
No context found.
A.P.M. Wagelmans, C.P.M. van Hoesel and A.W.J. Kolen (1992) "Economic lotsizing: an O(n log n) algorithm that runs in linear time in the Wagner-Whitin case", Operations Research 40S S145-S156.
Demand Behavior in Manufacturing Supply Chain-Model, and.. - Meixell, Wu (Correct)
No context found.
Wagelmans, A. S. van Hoesel, and A. Kolen, (1992) "Economic Lot Sizing: An O(n log n) Algorithm that Runs in Linear Time in the Wagner-Whitin Case" Operations Research, volume 40, supplement number 1, January-February, pages s145-s156.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC