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

An Optimal Strategy for the Constrained Cycle Cover Problem

โœ Scribed by Gilles Pesant; Patrick Soriano

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
607 KB
Volume
1
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Optimal strategy of route and look for t
Optimal strategy of route and look for the path constrained search problem with reward criterion
โœ 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

An optimal control model of neural netwo
An optimal control model of neural networks for constrained optimization problems
โœ Qiang Song; Robert P. Leland ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 67 KB ๐Ÿ‘ 2 views

Optimization neural networks have been studied and applied in the literature, and the mechanism of such neural networks has been investigated from the point of view of optimization theory. Yet, no studies have been found by the authors to investigate the mechanism from a control systems' perspective

An evolutionary strategy for decremental
An evolutionary strategy for decremental multiobjective optimization problems
โœ Sheng-Uei Guan; Qian Chen; Wenting Mo ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 162 KB

In this article, an evolutionary algorithm for multiobjective optimization problems in a dynamic environment is studied. In particular, we focus on decremental multiobjective optimization problems, where some objectives may be deleted during evolution-for such a process we call it objective decremen