A branch-and-cut algorithm for the maximum benefit Chinese postman problem (Q378087)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut algorithm for the maximum benefit Chinese postman problem |
scientific article |
Statements
A branch-and-cut algorithm for the maximum benefit Chinese postman problem (English)
0 references
11 November 2013
0 references
