Crossref
A lean expression-graph formulation for the Traveling Thief Problem and its interval bounds
Computers & Operations Research · 2027-04 · 197 · 107719
DOI: 10.1016/j.cor.2026.107719 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computers & Operations Research, 2027-04. Verfasst von Mahdi Khemakhem und 1 weiteren Autor:innen. Die Arbeit nennt 68 Literaturangaben. Gefördert von: Prince Sattam bin Abdulaziz University Deanship of Scientific Research.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Prince Sattam bin Abdulaziz University Deanship of Scientific Research
Zitieren
APA
Khemakhem, M., & Chebil, K. (2027). A lean expression-graph formulation for the Traveling Thief Problem and its interval bounds. Computers & Operations Research, 197, 107719. https://doi.org/10.1016/j.cor.2026.107719
Vancouver
Khemakhem M, Chebil K. A lean expression-graph formulation for the Traveling Thief Problem and its interval bounds. Computers & Operations Research. 2027;197:107719. doi:10.1016/j.cor.2026.107719
BibTeX
@article{Khemakhem2027,
author = {Khemakhem, Mahdi and Chebil, Khalil},
title = {A lean expression-graph formulation for the Traveling Thief Problem and its interval bounds},
journal = {Computers & Operations Research},
year = {2027},
volume = {197},
pages = {107719},
doi = {10.1016/j.cor.2026.107719}
}
EUVIMED