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

A dynamic programming approach to the complete set partitioning problem

โœ Scribed by D. Yun Yeh

Publisher
Springer Netherlands
Year
1986
Tongue
English
Weight
324 KB
Volume
26
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Dynamic programming approaches to the mu
Dynamic programming approaches to the multiple criteria knapsack problem
โœ Kathrin Klamroth; Margaret M. Wiecek ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 251 KB ๐Ÿ‘ 2 views

We study the integer multiple criteria knapsack problem and propose dynamicprogramming-based approaches to finding all the nondominated solutions. Different and more complex models are discussed, including the binary multiple criteria knapsack problem, problems with more than one constraint, and mul

A dynamic-programming approach to contin
A dynamic-programming approach to continuous-review obsolescent inventory problems
โœ Israel David; Eitan Greenshtein; Avraham Mehrez ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 130 KB ๐Ÿ‘ 1 views

Inventory models of modern production and service operations should take into consideration possible exogenous failures or the abrupt decline of demand resulting from obsolescence. This article analyzes continuous-review versions of the classical obsolescence problem in inventory theory. We assume a