The textbook Dantzig-Wolfe decomposition for the Capacitated Lot Sizing Problem (CLSP),as already proposed by Manne in 1958, has an important structural deficiency. Imposingintegrality constraints on the variables in the full blown master will not necessarily give theoptimal IP solution as only...

Proofs from complexity theory as well as computational experiments indicate that most lot sizing problems are hard to solve. Because these problems are so difficult, various solution techniques have been proposed to solve them. In the past decade, meta-heuristics such as tabu search, genetic...

We present new lower bounds for the Capacitated Lot Sizing Problem with Set Up Times. We improve the lower bound obtained by the textbook Dantzig-Wolfe decomposition where the capacity constraints are the linking constraints. In our approach, Dantzig-Wolfe decomposition is applied to the network...

An inherent characteristic of Ramp;D projects is technological uncertainty, which may result in project failure, and time and resources spent without any tangible return. In pharmaceutical projects, for instance, stringent scientific procedures have to be followed to ensure patient safety and...

Most attributes in transportation studies, such as the travel time and the travel cost of a travel mode or road alternative, have a clear rank order in their attribute levels. Therefore one option in a choice set of an experimental design can dominate the other alternatives in the set. This...

Despite the fact that many conjoint choice experiments offer respondents a no-choice option in every choice set, the optimal design of conjoint choice experiments involving no-choice options has received only a limited amount of attention in the literature. In this article, we present an...

Whereas the number of alternatives in a labelled discrete choice experiment is dictated by the number of available labels, the choice set size in unlabelled choice experiments can be set more freely. Determining the number of alternatives that will both yield enough information about the...