EUVIMEDEUVIMED entdecken
Crossref

An approximation algorithm for the asymmetric profitable tour problem with submodular penalties

Zhenzhen Pang, Wen Liu, Bo Hou

Theoretical Computer Science · 2026-06 · 1076 · 115967

DOI: 10.1016/j.tcs.2026.115967 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-06. Verfasst von Zhenzhen Pang und 2 weiteren Autor:innen. Die Arbeit nennt 14 Literaturangaben. Gefördert von: National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • National Natural Science Foundation of China

Zitieren

APA

Pang, Z., Liu, W., & Hou, B. (2026). An approximation algorithm for the asymmetric profitable tour problem with submodular penalties. Theoretical Computer Science, 1076, 115967. https://doi.org/10.1016/j.tcs.2026.115967

Vancouver

Pang Z, Liu W, Hou B. An approximation algorithm for the asymmetric profitable tour problem with submodular penalties. Theoretical Computer Science. 2026;1076:115967. doi:10.1016/j.tcs.2026.115967

BibTeX
@article{Pang2026,
  author = {Pang, Zhenzhen and Liu, Wen and Hou, Bo},
  title = {An approximation algorithm for the asymmetric profitable tour problem with submodular penalties},
  journal = {Theoretical Computer Science},
  year = {2026},
  volume = {1076},
  pages = {115967},
  doi = {10.1016/j.tcs.2026.115967}
}
Kostenlos starten →