Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q1652698): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q129925056, #quickstatements; #temporary_batch_1724809781087 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129925056 / rank | |||
Normal rank | |||
Latest revision as of 02:55, 28 August 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
0 references
0 references
0 references
0 references
0 references
