A path‐based two‐commodity flow model and a branch‐price‐and‐cut algorithm for the inventory routing problem with time windows

Charaf, Sara; Desaulniers, Guy; Quesnel, Frédéric; Taş, Duygu; Douwe P. Flapper, Simme; Van Woensel, Tom; Charaf, Sara; Desaulniers, Guy; Quesnel, Frédéric; Taş, Duygu; Douwe P. Flapper, Simme; Van Woensel, Tom

A path‐based two‐commodity flow model and a branch‐price‐and‐cut algorithm for the inventory routing problem with time windows

Sara Charaf, Guy Desaulniers , Frédéric Quesnel, Duygu Taş, Simme Douwe P. Flapper, Tom Van Woensel

Article (2026)

Access this document

External link

Open access to the full text at the publisher's website

View at the official publisher

Uncontrolled Keywords

Department:

Department of Mathematics and Industrial Engineering

Research Center:

GERAD - Research Group in Decision Analysis

Funders:

Nederlandse Organisatie voor Wetenschappelijk Onderzoek

Grant number:

439.18.457

PolyPublie URL:

https://publications.polymtl.ca/80065/

Journal Title :

International Transactions in Operational Research

Publisher:

Wiley

DOI:

10.1111/itor.70235

Official URL:

https://doi.org/10.1111/itor.70235

OAI:

oai:publications.polymtl.ca:80065

ORCID

Date Deposited:

29 Jul 2026 12:10

Last Modified:

08 Oct 2026 19:14

Cite in APA 7:

Charaf, S., Desaulniers, G., Quesnel, F., Taş, D., Douwe P. Flapper, S., & Van Woensel, T. (2026). A path‐based two‐commodity flow model and a branch‐price‐and‐cut algorithm for the inventory routing problem with time windows. International Transactions in Operational Research, 32 pages. https://doi.org/10.1111/itor.70235

Statistics

Dimensions

Repository Staff Only

View Item