Fast Polynomial Time Approximate Solution for 0-1 Knapsack Problem

0-1 Knapsack problem (KP) is NP-hard. Approximate solution is vital for solving KP exactly. In this paper, a fast polynomial time approximate solution (FPTAS) is proposed for KP. FPTAS is a local search algorithm. The best approximate solution to KP can be found in the neighborhood of the solution o...

Descripción completa

Detalles Bibliográficos
Autores principales: Wang, Zhengyuan, Zhang, Hui, Li, Yali
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Hindawi 2022
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9617712/
https://www.ncbi.nlm.nih.gov/pubmed/36317076
http://dx.doi.org/10.1155/2022/1266529

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9617712/
https://www.ncbi.nlm.nih.gov/pubmed/36317076
http://dx.doi.org/10.1155/2022/1266529

Ejemplares similares