Dominance relations in unbounded knapsack problems

Abstract: "The Unbounded Knapsack Problem (UKP) is a generalization of the 0-1 Knapsack Problem where an unlimited amount of each item type is available. In any efficient algorithm for UKP the reduction of dominated item types plays a central role, as the size of an instance may be decreased co...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Pisinger, David (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	København 1994
Schriftenreihe:	Datalogisk Institut <København>: DIKU-Rapport 1994,33
Schlagworte:	Combinatorial optimization Computer algorithms Operations research Sorting (Electronic computers)
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!