430 search results - page 38 / 86 » eor 2010 |
EOR
2006
14 years 10 months ago
2006
We are concerned with a variation of the knapsack problem as well as of the knapsack sharing problem, where we are given a set of n items and a knapsack of a fixed capacity. As us...
EOR
2006
14 years 10 months ago
2006
We introduce the two-stage stochastic maximum-weight matching problem and demonstrate that this problem is NP-complete. We give a factor 1 2 approximation algorithm and prove its ...
EOR
2006
14 years 10 months ago
2006
There are many resource restrictions in real production/inventory systems (for example, budget, storage, transportation capacity, etc.). But unlike other research areas, there is ...
EOR
2006
14 years 10 months ago
2006
We used the so-called deterministic annealing algorithm due to Rose and Gurewitz by the classification of patent documents. A C++ program based on this algorithm was run first on s...
EOR
2006
14 years 10 months ago
2006
The yard allocation problem (YAP) is a real-life resource allocation problem faced by the Port of Singapore Authority (PSA). As the problem is NP-hard, we propose an effective met...