Approximation Algorithms for the Bounded Knapsack Interdiction Problem
Journal of the Operations Research Society of China · 13.06.2026
DOI: 10.1007/s40305-026-00705-4 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of the Operations Research Society of China, online erschienen am 13.06.2026. Verfasst von Rui-Qing Sun und 1 weiteren Autor:innen. Die Arbeit nennt 20 Literaturangaben. Gefördert von: Yunnan Fundamental Research Projects, Scientific Research and Innovation Project of Postgraduate Students in the Academic Degree of Yunnan University.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Yunnan Fundamental Research Projects
- Scientific Research and Innovation Project of Postgraduate Students in the Academic Degree of Yunnan University
Zitieren
APA
Sun, R., & Li, W. (2026). Approximation Algorithms for the Bounded Knapsack Interdiction Problem. Journal of the Operations Research Society of China. https://doi.org/10.1007/s40305-026-00705-4
Vancouver
Sun R, Li W. Approximation Algorithms for the Bounded Knapsack Interdiction Problem. Journal of the Operations Research Society of China. 2026. doi:10.1007/s40305-026-00705-4
BibTeX
@article{Sun2026,
author = {Sun, Rui-Qing and Li, Wei-Dong},
title = {Approximation Algorithms for the Bounded Knapsack Interdiction Problem},
journal = {Journal of the Operations Research Society of China},
year = {2026},
doi = {10.1007/s40305-026-00705-4}
}
EUVIMED