An exact algorithm for the asymmetrical capacitated vehicle routing problem (Q3786261): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q126263650, #quickstatements; #temporary_batch_1719332822301 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230160104 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2003071307 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the symmetric travelling salesman problem: A computational study / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126263650 / rank | |||
Normal rank | |||
Latest revision as of 17:32, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact algorithm for the asymmetrical capacitated vehicle routing problem |
scientific article |
Statements
An exact algorithm for the asymmetrical capacitated vehicle routing problem (English)
0 references
1986
0 references
asymmetrical capacitated vehicle routing
0 references
multiple traveling salesman
0 references
capacity restrictions
0 references
branch and bound tree
0 references
