Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem (Q342313): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / describes a project that uses | |||
Property / describes a project that uses: VRP / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2262246802 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1508.02759 / rank | |||
Normal rank |
Revision as of 13:44, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem |
scientific article |
Statements
Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem (English)
0 references
17 November 2016
0 references
vehicle routing problem
0 references
large neighborhood search
0 references
split algorithm
0 references
cluster-first route-second heuristic
0 references