EUVIMEDEUVIMED entdecken
Crossref

Fractional Knapsack Problem with a Concave Penalized Objective Function and Position-Dependent Item Weights (Profits)

Fanyu Kong, Cuixia Miao, Yuzhong Zhang

International Journal of Foundations of Computer Science · 11.11.2026 · 1-18

DOI: 10.1142/s0129054126490109 ↗

Kurz gefasst

Fachartikel in der Zeitschrift International Journal of Foundations of Computer Science, online erschienen am 11.11.2026. Verfasst von Fanyu Kong und 2 weiteren Autor:innen. Gefördert von: National Natural Science Foundation of China, Province Natural Science Foundation of Shandong.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Fractional Knapsack Problem with Concave Penalties (FKPCP) is a variant of the knapsack problem in which items can be split at the expense of a concave penalty function depending on the fractional quantity. We consider the FKPCP with variable weights or profits of items, where the weight or profit of an item depends on its position in the packing sequence. Based on relevant properties of these problems, for FKPCP involving items with variable weights or profits, we propose pseudo-polynomial time exact algorithms and approximation algorithms, respectively.

Förderung

  • National Natural Science Foundation of China
  • Province Natural Science Foundation of Shandong

Zitieren

APA

Kong, F., Miao, C., & Zhang, Y. (2026). Fractional Knapsack Problem with a Concave Penalized Objective Function and Position-Dependent Item Weights (Profits). International Journal of Foundations of Computer Science, 1-18. https://doi.org/10.1142/s0129054126490109

Vancouver

Kong F, Miao C, Zhang Y. Fractional Knapsack Problem with a Concave Penalized Objective Function and Position-Dependent Item Weights (Profits). International Journal of Foundations of Computer Science. 2026:1-18. doi:10.1142/s0129054126490109

BibTeX
@article{Kong2026,
  author = {Kong, Fanyu and Miao, Cuixia and Zhang, Yuzhong},
  title = {Fractional Knapsack Problem with a Concave Penalized Objective Function and Position-Dependent Item Weights (Profits)},
  journal = {International Journal of Foundations of Computer Science},
  year = {2026},
  pages = {1--18},
  doi = {10.1142/s0129054126490109}
}
Kostenlos starten →