problem results in an [TeX: $O(n^2 \bar{c} \bar{d} )$] algorithm, where [TeX: $n$] is the number of periods, and [TeX: $\bar d … of our algorithm is only <it>linearly</it> dependent on the magnitude of the data. This result also holds if extensions … such as backlogging and start-up costs are considered. Moreover, computational experiments indicate that the algorithm is …

We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming … problems with a min-sum or min-max objective function. Our algorithms run in polynomial time if the optimization problem itself …

optimization methods for two-mode clustering. Several known algorithms are discussed and a new, fuzzy algorithm is introduced. The … meta-heuristics Multistart, Simulated Annealing, and Tabu Search are used in combination with these algorithms. The new …, fuzzy algorithm is based on the fuzzy c-means algorithm of Bezdek (1981) and the Fuzzy Steps approach to avoid local minima …

algorithms for the problem. Specifically, we provide algorithms for the general lot-sizing problem with bounded inventory and …

general concave production and inventory costs, we present an O(T2) dynamic programming algorithm where ï”is the length of … the planning horizon. Furthermore, for fixed-charge and nonspeculative costs, we provide O(Tlog T) and O(T) algorithms …