Branch‐price‐and‐cut for the truck–drone routing problem with time windows (Q6054751)
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 7754315
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch‐price‐and‐cut for the truck–drone routing problem with time windows |
scientific article; zbMATH DE number 7754315 |
Statements
Branch‐price‐and‐cut for the truck–drone routing problem with time windows (English)
0 references
25 October 2023
0 references
branch-price-and-cut
0 references
routing
0 references
time window
0 references
truck-drone combination
0 references
0 references
0 references
0 references
0 references
0 references
0.8607584834098816
0 references
0.8471429944038391
0 references
0.8454018831253052
0 references
0.8410510420799255
0 references
0.8179570436477661
0 references
