Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem (Q6635813)
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: Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem |
scientific article; zbMATH DE number 7941542
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem |
scientific article; zbMATH DE number 7941542 |
Statements
Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem (English)
0 references
12 November 2024
0 references
combinatorial optimization
0 references
mixed graphs
0 references
vertex traversal times
0 references
Chinese postman routing
0 references
approximation algorithms
0 references
0 references
0 references
