Improving the average time for solving subset-sum problem instances : algorithm variations and performance analysis
The Subset-sum Problem (SSP) consists of finding a subset of a set of integers whose sum is as close as possible to a target amount, without exceeding it. The problem is NP-complete, but there are dynamic programming-based algorithms which can solve many instances in reasonable time. Most of these a...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English |
| Published: |
Instituto Tecnológico de Aeronáutica
2013
|
| Subjects: | |
| Online Access: | http://www.bd.bibl.ita.br/tde_busca/arquivo.php?codArquivo=2878 |