Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q1652698): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:15, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem |
scientific article |
Statements
Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (English)
0 references
11 July 2018
0 references
travelling salesman
0 references
vehicle routing problem
0 references
split demand
0 references
heuristics
0 references
