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

A search strategy for the one-size assortment problem

โœ Scribed by Horacio Hideki Yanasse


Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
553 KB
Volume
74
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A two-objective mathematical model witho
โœ Nergiz Kasimbeyli; Tugba Sarac; Refail Kasimbeyli ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 244 KB

This paper considers a one-dimensional cutting stock and assortment problem. One of the main difficulties in formulating and solving these kinds of problems is the use of the set of cutting patterns as a parameter set in the mathematical model. Since the total number of cutting patterns to be genera

Optimal strategy of route and look for t
โœ Ryusuke Hohzaki; Koji Iida ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 741 KB

A target is moving among a finite number of cells K= {1 ..... K} in discrete time T= {1 ..... T}. Knowing the probability of the target's path selection, a searcher is searching for the target with constraints that he can move from cell i to one of the adjacent cells l(i). The searcher detects the t

A tabu search strategy for an efficient
โœ M. Dionigi; R. Sorrentino; L. Tarricone; A. Esposito ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 210 KB ๐Ÿ‘ 2 views

A strategy is proposed to enhance the performance of some numerical methods used in the solution of electromagnetic problems. The strategy can be extended to any numerical method based on the partitioning of the spatial domain into elementary cells. Two different implementations of the strategy are