An exact solution method for the TSP with drone based on decomposition
type: Item
instance of: scholarly article
title: An exact solution method for the TSP with drone based on decomposition
author: Sebastián A. Vásquez
author: Gustavo Angulo
author: Mathias A. Klapp
published in: Computers \& Operations Research
publication date: 2021-05-21T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7350526
zbMATH Keywords: traveling salesman
zbMATH Keywords: vehicle routing
zbMATH Keywords: drones
zbMATH Keywords: benders' decomposition
MaRDI profile type: Publication
full work available at URL: j.cor.2020.105127
OpenAlex ID: W3097153424
cites work: Improving the integer L-shaped method
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: A note on the prize collecting traveling salesman problem
cites work: A randomized variable neighborhood descent heuristic to solve the flying sidekick traveling salesman problem
cites work: The integer \(L\)-shaped method for stochastic integer programs with complete recourse
cites work: The Benders decomposition algorithm: a literature review
cites work: A study on the traveling salesman problem with a drone
DOI: 10.1016/J.COR.2020.105127
description: scientific article; zbMATH DE number 7350526