A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q2242245)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem |
scientific article |
Statements
A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (English)
0 references
9 November 2021
0 references
travelling salesman
0 references
vehicle routing problem
0 references
split demand
0 references
pickup-and-delivery
0 references
bike shared system
0 references
0 references
0 references
0 references
