๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Polynomial approximation technique for dynamic optimization problems

โœ Scribed by David F. Dianich; Jatinder N.D. Gupta

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
502 KB
Volume
13
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Polynomial time approximation schemes fo
Polynomial time approximation schemes for class-constrained packing problems
โœ Hadas Shachnai; Tami Tamir ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Springer US ๐ŸŒ English โš– 207 KB

We consider variants of the classic bin packing and multiple knapsack problems, in which sets of items of di erent classes (colours) need to be placed in bins; the items may have di erent sizes and values. Each bin has a limited capacity, and a bound on the number of distinct classes of items it can

Approximation methods for reliability-ba
Approximation methods for reliability-based design optimization problems
โœ Irfan Kaymaz ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 192 KB

## Abstract Deterministic optimum designs are obtained without considering of uncertainties related to the problem parameters such as material parameters (yield stress, allowable stresses, moment capacities, etc.), external loadings, manufacturing errors, tolerances, cost functions, which could lea