Modular decomposition is a thoroughly investigated topic inmany areas such as switching theory, reliability theory, game theory andgraph theory. We propose an O(mn)-algorithm for the recognition of amodular set of a monotone Boolean function f with m prime implicantsand n variables. Using this...

A stochastic inventory routing problem (SIRP) is typically the combination of stochastic inventory control problems and NP-hard vehicle routing problems, for a depot to determine delivery volumes to its customers in each period, and vehicle routes to distribute the delivery volumes. This paper...

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...

In this technical note we give a short proof based on standard results in convex analysis of some important characterization results listed in Theorem 3 and 4 of [1]. Actually our result is slightly general since we do not specify the convex set X. For clarity we use the same notation for the...

In this paper we discuss a real-life case study in the optimization of the logistics network for the collection of containers from end-of-life vehicle dismantlers in the Netherlands.Advanced planning concepts like dynamic assignment of dismantlers to logistic service providers are analyzed by a...

In this paper, we study the problem of scheduling and dispatching vehicles in vehicle-based internal transport systems within warehouses and production facilities. We develop and use two rolling horizon policies to solve real-time vehicle scheduling problems. To solve static instances of...

In this paper we describe the successful application of a sophisticated Operations Research model and the corresponding solution techniques for scheduling the 6,500+ drivers and conductors of the Dutch railway operator NS Reizigers (Netherlands Railways). In 2001 the drivers and conductors were...

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...

The present paper proposes a new approach to solve generalized fractional programming problems through user interaction. Capitalizing on two alternatives, we review the Dinkelbach-type methods and set forth the main difficulty in applying these methods. In order to cope with this difficulty, we...