Heuristic and exact reduction procedures to solve the discounted 0–1 knapsack problem

•Heuristic and exact fixation rules are introduced to strengthen dynamic programming.•Instances from the literature are solved by the proposed approach very easily.•Harder instances for exact methods are generated to justify the use of heuristic. In this paper we consider the discounted 0–1 knapsack...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research 2023-02, Vol.304 (3), p.901-911
Hauptverfasser:	Wilbaut, Christophe, Todosijevic, Raca, Hanafi, Saïd, Fréville, Arnaud
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorial optimization Computer Science Discounted knapsack problem Dynamic programming Fixation Instance generator Operations Research
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!