Fuzzy termination criteria in Knapsack Problem algorithms.
Verdegay, José Luis ; Vergara-Moreno, Edmundo
Mathware and Soft Computing, Tome 7 (2000), p. 89-97 / Harvested from Biblioteca Digital de Matemáticas
Access to full text

Fuzzy rule based termination criteria are introduced in two conventional and exact algorithms solving Knapsack Problems. As a consequence two new solution algorithms are obtained. These algorithms are heuristic ones with a high performance. The efficiency of the algorithms obtained is illustrated by solving some numerical examples.

Publié le : 2000-01-01
DMLE-ID : 1935 
@article{urn:eudml:doc:39190,
     title = {Fuzzy termination criteria in Knapsack Problem algorithms.},
     journal = {Mathware and Soft Computing},
     volume = {7},
     year = {2000},
     pages = {89-97},
     zbl = {0992.90059},
     mrnumber = {MR1858049},
     language = {en},
     url = {http://dml.mathdoc.fr/item/urn:eudml:doc:39190}
}

Verdegay, José Luis; Vergara-Moreno, Edmundo. Fuzzy termination criteria in Knapsack Problem algorithms.. Mathware and Soft Computing, Tome 7 (2000) pp. 89-97. http://gdmltest.u-ga.fr/item/urn:eudml:doc:39190/