The Capacitated Arc Routing Problem: Lower bounds (Q4022732): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user 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.1002/net.3230220706 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2036924136 / rank | |||
Normal rank | |||
Latest revision as of 14:28, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Capacitated Arc Routing Problem: Lower bounds |
scientific article |
Statements
The Capacitated Arc Routing Problem: Lower bounds (English)
0 references
17 January 1993
0 references
Chinese postman
0 references
capacitated arc routing problem
0 references
minimum total cost
0 references
lower bounds
0 references
minimum cost perfect matching
0 references
vehicle capacity
0 references
