A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q2242245)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7422912
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem |
scientific article; zbMATH DE number 7422912 |
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
0.9620358
0 references
0.9393081
0 references
0.93503416
0 references
0.9241349
0 references
0.9190247
0 references
0.9085475
0 references
0.90812314
0 references
0.9077451
0 references
0.90741944
0 references
