Fuzzy termination criteria in Knapsack Problem algorithms.

José Luis Verdegay; Edmundo Vergara-Moreno

Mathware and Soft Computing (2000)

  • Volume: 7, Issue: 2-3, page 89-97
  • ISSN: 1134-5632

Abstract

top
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.

How to cite

top

Verdegay, José Luis, and Vergara-Moreno, Edmundo. "Fuzzy termination criteria in Knapsack Problem algorithms.." Mathware and Soft Computing 7.2-3 (2000): 89-97. <http://eudml.org/doc/39190>.

@article{Verdegay2000,
abstract = {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.},
author = {Verdegay, José Luis, Vergara-Moreno, Edmundo},
journal = {Mathware and Soft Computing},
keywords = {Problema de la mochila; Programación matemática; Programación entera; Algoritmos; Programación dinámica; Conjuntos difusos; fuzzy rule based termination criteria; algorithms heuristic; knapsack problems; solution algorithms},
language = {eng},
number = {2-3},
pages = {89-97},
title = {Fuzzy termination criteria in Knapsack Problem algorithms.},
url = {http://eudml.org/doc/39190},
volume = {7},
year = {2000},
}

TY - JOUR
AU - Verdegay, José Luis
AU - Vergara-Moreno, Edmundo
TI - Fuzzy termination criteria in Knapsack Problem algorithms.
JO - Mathware and Soft Computing
PY - 2000
VL - 7
IS - 2-3
SP - 89
EP - 97
AB - 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.
LA - eng
KW - Problema de la mochila; Programación matemática; Programación entera; Algoritmos; Programación dinámica; Conjuntos difusos; fuzzy rule based termination criteria; algorithms heuristic; knapsack problems; solution algorithms
UR - http://eudml.org/doc/39190
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.