On the complexity of the \(k\)-customer vehicle routing problem (Q1886800): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.orl.2004.04.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1994993627 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3056948 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4437515 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds and Heuristics for Capacitated Routing Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3799801 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4142699 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the completeness of a generalized matching problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the \(k\)-path partition of graphs. / rank | |||
Normal rank | |||
Latest revision as of 15:28, 7 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the \(k\)-customer vehicle routing problem |
scientific article |
Statements
On the complexity of the \(k\)-customer vehicle routing problem (English)
0 references
19 November 2004
0 references
Approximation algorithms
0 references
Vehicle routing problem
0 references
