Techniques for solving subset sum problems within a given tolerance

The subset sum problem is a simple and fundamental NP‐hard problem that is found in many real world applications. For the particular application motivating this paper (combination weighers) a solution is required to the subset sum problem that is within a small tolerance level, and can be computed q...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	International transactions in operational research 2005-07, Vol.12 (4), p.437-453
Hauptverfasser:	James, R. J. W., Storer, R. H.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms branch-and-bound enumeration heuristics Operations research Studies subset sum
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!