EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-ND 4.0

Linear Programming of the Loopwise Route Representation for the Shortest Path Problems by Introducing the Reference Link Flow

Geunu Kim, Changyeong Kim, Sanghoon Park, Jeonghun Kim, In Gwun Jang

IEEE Access · 2025 · 13 · 38856-38864

DOI: 10.1109/access.2025.3546320 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Access, 2025. Verfasst von Geunu Kim und 4 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 35 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0). Gefördert von: Transportation and Logistics Research and Development funded by the Ministry of Land, Infrastructure, and Transport of Korean Government.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Transportation and Logistics Research and Development funded by the Ministry of Land, Infrastructure, and Transport of Korean Government

Zitieren

APA

Kim, G., Kim, C., Park, S., Kim, J., & Jang, I. G. (2025). Linear Programming of the Loopwise Route Representation for the Shortest Path Problems by Introducing the Reference Link Flow. IEEE Access, 13, 38856-38864. https://doi.org/10.1109/access.2025.3546320

Vancouver

Kim G, Kim C, Park S, Kim J, Jang IG. Linear Programming of the Loopwise Route Representation for the Shortest Path Problems by Introducing the Reference Link Flow. IEEE Access. 2025;13:38856-38864. doi:10.1109/access.2025.3546320

BibTeX
@article{Kim2025,
  author = {Kim, Geunu and Kim, Changyeong and Park, Sanghoon and Kim, Jeonghun and Jang, In Gwun},
  title = {Linear Programming of the Loopwise Route Representation for the Shortest Path Problems by Introducing the Reference Link Flow},
  journal = {IEEE Access},
  year = {2025},
  volume = {13},
  pages = {38856--38864},
  doi = {10.1109/access.2025.3546320}
}
Kostenlos starten →