A branch-and-cut algorithm for the vehicle routing problem with drones

Research output: Contribution to journalResearch articleContributedpeer-review

Details

Original languageEnglish
Pages (from-to)174-203
Number of pages30
JournalTransportation Research. Part B, Methodological
Publication statusPublished - Feb 2021
Peer-reviewedYes

External IDs

Scopus 85099193690
ORCID /0000-0003-1650-8936/work/142250304
ORCID /0000-0003-4711-2184/work/142252502

Keywords

Research priority areas of TU Dresden

Keywords

  • Vehicle routing problem Drones Branch-and-cut Valid inequalities