Open Access · CC BY 4.0
Model-based algorithms for the 0-1 Time-Bomb Knapsack Problem
Computers & Operations Research · 2025-06 · 178 · 107010
DOI: 10.1016/j.cor.2025.107010 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computers & Operations Research, 2025-06. Verfasst von Roberto Montemanni und 1 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 26 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Montemanni, R., & Smith, D. H. (2025). Model-based algorithms for the 0-1 Time-Bomb Knapsack Problem. Computers & Operations Research, 178, 107010. https://doi.org/10.1016/j.cor.2025.107010
Vancouver
Montemanni R, Smith DH. Model-based algorithms for the 0-1 Time-Bomb Knapsack Problem. Computers & Operations Research. 2025;178:107010. doi:10.1016/j.cor.2025.107010
BibTeX
@article{Montemanni2025,
author = {Montemanni, Roberto and Smith, Derek H.},
title = {Model-based algorithms for the 0-1 Time-Bomb Knapsack Problem},
journal = {Computers & Operations Research},
year = {2025},
volume = {178},
pages = {107010},
doi = {10.1016/j.cor.2025.107010}
}
EUVIMED