EUVIMEDEUVIMED entdecken
Crossref

An exact branch-price-and-cut algorithm for the time-dependent cold chain pickup and delivery problem with incompatibility constraints

Hongyuan Luo, Tao Ma, Zhendong Li

Computers & Operations Research · 2025-06 · 178 · 107007

DOI: 10.1016/j.cor.2025.107007 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Computers & Operations Research, 2025-06. Verfasst von Hongyuan Luo und 2 weiteren Autor:innen. Die Arbeit wurde bisher 14-mal zitiert (Crossref) und nennt 36 Literaturangaben. Gefördert von: Hubei Province Natural Science Foundation, National Natural Science Foundation of China, Fundamental Research Funds for the Central Universities.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Hubei Province Natural Science Foundation
  • National Natural Science Foundation of China
  • Fundamental Research Funds for the Central Universities
  • China Postdoctoral Science Foundation

Zitieren

APA

Luo, H., Ma, T., & Li, Z. (2025). An exact branch-price-and-cut algorithm for the time-dependent cold chain pickup and delivery problem with incompatibility constraints. Computers & Operations Research, 178, 107007. https://doi.org/10.1016/j.cor.2025.107007

Vancouver

Luo H, Ma T, Li Z. An exact branch-price-and-cut algorithm for the time-dependent cold chain pickup and delivery problem with incompatibility constraints. Computers & Operations Research. 2025;178:107007. doi:10.1016/j.cor.2025.107007

BibTeX
@article{Luo2025,
  author = {Luo, Hongyuan and Ma, Tao and Li, Zhendong},
  title = {An exact branch-price-and-cut algorithm for the time-dependent cold chain pickup and delivery problem with incompatibility constraints},
  journal = {Computers & Operations Research},
  year = {2025},
  volume = {178},
  pages = {107007},
  doi = {10.1016/j.cor.2025.107007}
}
Kostenlos starten →