Approximate solutions for the maximum benefit chinese postman problem (Q5426612)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximate solutions for the maximum benefit chinese postman problem |
scientific article; zbMATH DE number 5210893
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate solutions for the maximum benefit chinese postman problem |
scientific article; zbMATH DE number 5210893 |
Statements
Approximate solutions for the maximum benefit chinese postman problem (English)
0 references
13 November 2007
0 references
approximate solutions
0 references
maximum benefit Chinese postman problem
0 references
algorithms
0 references
0 references
0.9292582
0 references
0.9256041
0 references
0.92282724
0 references
0.91976684
0 references
0.9150347
0 references
0.9138634
0 references
0.90441686
0 references
