Efficient 0/1-Multiple-Knapsack Problem Solving by Hybrid DP Transformation and Robust Unbiased Filtering

The multiple knapsack problem (0/1-mKP) is a valuable NP-hard problem involved in many science-and-engineering applications. In current research, there exist two main approaches: 1. the exact algorithms for the optimal solutions (i.e., branch-and-bound, dynamic programming (DP), etc.) and 2. the app...

Descrizione completa

Dettagli Bibliografici

Autori principali:	Patcharin Buayen, Jeeraporn Werapun
Natura:	Artigo
Lingua:	Inglês
Pubblicazione:	MDPI AG 2022-09-01
Serie:	Algorithms
Soggetti:	multiple 0/1-knapsack problem (0/1-mKP) efficient NP-hard problem solving exact-DP transformation exact-fit (best) knapsack order robust unbiased filtering
Accesso online:	https://www.mdpi.com/1999-4893/15/10/366
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!