A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs (Q6064162)
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 7776607
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs |
scientific article; zbMATH DE number 7776607 |
Statements
A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs (English)
0 references
12 December 2023
0 references
branch-and-cut
0 references
handling cost
0 references
last-in-first-out
0 references
pickup-and-delivery
0 references
precedence constraints
0 references
traveling salesman problem
0 references
0 references
0 references
0 references
0 references
0 references
0.9696834
0 references
0.94052917
0 references
0.93717647
0 references
0.9366291
0 references
0.9327453
0 references
0.9313331
0 references
0.92625034
0 references
0.92462885
0 references
0.9241349
0 references
