This paper introduces a general, formal treatment of dynamic constraints, i.e., constraints on the state changes that are allowed in a given state space. Such dynamic constraints can be seen as representations of "real world" constraints in a managerial context. The notions of transition,...

A solid board factory produces rectangular sheets of cardboard in two different formats, namely large formats and small formats. The production process consists of two stages separated by an inventory point. In the first stage a cardboard machine produces the large formats. In the second stage a...

New product development is one of the most powerful but difficult activities in business. It is also a very important factor affecting final product quality. There are many techniques available for new product development. Experimental design is now regarded as one of the most significant...

The simple plant location problem is a well-studied problem in combinatorial optimization. It is one of deciding where to locate a set of plants so that a set of clients can be supplied by them at the minimum cost. This problem of ten appears as a subproblem in other combinatorial problems....

New product development is one of the most powerful but difficult activities in business. It is also a very important factor affecting final product quality. There are many techniques available for new product development. Experimental design is now regarded as one of the most significant...

Although Branch and Bound (BnB) methods are among the most widely used techniques for solving hard problems, it is still a challenge to make these methods smarter. In this paper, we investigate iterative patching, a technique in which a fixed patching procedure is applied at each node of the BnB...

For a given optimal solution to a combinatorial optimization problem, we show, under very natural conditions, the equality of the minimal values of upper and lower tolerances, where the upper tolerances are calculated for the given optimal solution and the lower tolerances outside the optimal...

In this paper we deal with a pseudo-Boolean representation of the simple plant location problem. We define instances of this problem that are equivalent, in the sense that each feasible solution has the same goal function value in all such instances. We further define a collection of polytopes...