Displaying similar documents to “The online specialization problem.”

Stochastic bottleneck transportation problem with flexible supply and demand quantity

Yue Ge, Hiroaki Ishii (2011)

Kybernetika

Similarity:

We consider the following bottleneck transportation problem with both random and fuzzy factors. There exist m supply points with flexible supply quantity and n demand points with flexible demand quantity. For each supply-demand point pair, the transportation time is an independent positive random variable according to a normal distribution. Satisfaction degrees about the supply and demand quantity are attached to each supply and each demand point, respectively. They are denoted by membership...

A branch&bound algorithm for solving one-dimensional cutting stock problems exactly

Guntram Scheithauer, Johannes Terno (1995)

Applicationes Mathematicae

Similarity:

Many numerical computations reported in the literature show only a small difference between the optimal value of the one-dimensional cutting stock problem (1CSP) and that of the corresponding linear programming relaxation. Moreover, theoretical investigations have proven that this difference is smaller than 2 for a wide range of subproblems of the general 1CSP.