A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery (Q705506)
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 2131577
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery |
scientific article; zbMATH DE number 2131577 |
Statements
A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery (English)
0 references
31 January 2005
0 references
Traveling salesman problem
0 references
Pickup and delivery
0 references
Benders' cuts
0 references
Branch and cut
0 references
0 references
0.8814331889152527
0 references
0.8480405807495117
0 references
0.8398480415344238
0 references
