Fuzzy termination criteria in Knapsack problem algorithms
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...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2000 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2099/3569 |
| Acceso en línea: | https://hdl.handle.net/2099/3569 |
| Access Level: | acceso abierto |
| Palabra clave: | Algorithms Knapsack Problem Fuzzy Rule Based Systems Algorismes Classificació AMS::68 Computer science::68W Algorithms |
| Sumario: | 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. |
|---|