Approximate solutions for the capacitated arc routing problem (Q1121808): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Capacitated arc routing problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Matching, Euler tours and the Chinese postman / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A parallel insert method for the capacitated arc routing problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximate solutions for the maximum benefit chinese postman problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases / rank | |||
Normal rank | |||
Latest revision as of 14:41, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate solutions for the capacitated arc routing problem |
scientific article |
Statements
Approximate solutions for the capacitated arc routing problem (English)
0 references
1989
0 references
capacitated arc routing
0 references
computational complexity
0 references
heuristic algorithms
0 references
near-optimal solutions
0 references
