AKBALIK, Ayse; PENZ, Bernard - Center for Operations Research and Econometrics (CORE), … - 2007
the problem is NP-hard in the ordinary sense. We then compare the computational time of this dynamic program to that of a … that the
problem is NP-hard in the ordinary sense. We then compare the computational time of this
dynamic program to that … computational time.
Keywords: multi-plant production, transportation, single-item capacitated lot sizing
problem, dynamic …