Worst case behavior of the steepest edge simplex method
β Scribed by Donald Goldfarb; William Y. Sit
- Book ID
- 104182571
- Publisher
- Elsevier Science
- Year
- 1979
- Tongue
- English
- Weight
- 990 KB
- Volume
- 1
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In the parametric bin packing problem we must pack a list of items with size smaller than or equal to 1rr in a minimal number of unit-capacity bins. Among the Ε½ . approximation algorithms, the class of Harmonic Fit algorithms HF plays an M
In this article, we propose the method of the multicriteria alternative selection under uncertainty. The basis of the method is the principle of the Bellman-Zadeh fuzzy measures intersection and nine-point linguistic rating scale of Saaty. The novelty of the method presented here consists of the fac
The First-Fit-Decreasing FFD algorithm is one of the most famous and most studied methods for an approximative solution of the bin-packing problem. The question on the parametric behavior of the FFD heuristic for small items was Ε½ .