An optimal algorithm for the mixed Chinese postman problem (Q4887738)
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: Publication:4887738 |
scientific article; zbMATH DE number 913346
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal algorithm for the mixed Chinese postman problem |
scientific article; zbMATH DE number 913346 |
Statements
5 August 1996
0 references
Chinese postman problem
0 references
Gomory cuts
0 references
blossom inequalities
0 references
balanced set constraints
0 references
An optimal algorithm for the mixed Chinese postman problem (English)
0 references
0.90650475025177
0 references
0.90650475025177
0 references
0.9030805230140686
0 references
