The two-dimensional orthogonal packing problem (2OPP) consists in determining if a set of rectangles can be packed in a larger rectangle of fixed size. We propose an exact method ...
This paper presents an algorithm for generating unconstrained guillotine-cutting patterns for rectangular blanks. A pattern includes at most two sections, each of which consists o...
Optimal flow control problems of multiple-server (M/M/n) queueing systems are studied. Due to enhanced flexibility of the decision making, intuitively, we expect that grouping tog...
There is an age old debate in curling about whether it is better to be down one point with last shot, or ahead by one point without. The objective of this paper is to apply sensit...
We are interested in the graph coloring problem. We propose an exact method based on a linear-decomposition of the graph. The complexity of this method is exponential according to...