Developing the branch and bound method in the problem of searching for the optimal cyclic route (cyclic rural postman problem) (Q465989)
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: Developing the branch and bound method in the problem of searching for the optimal cyclic route (cyclic rural postman problem) |
scientific article; zbMATH DE number 6361233
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Developing the branch and bound method in the problem of searching for the optimal cyclic route (cyclic rural postman problem) |
scientific article; zbMATH DE number 6361233 |
Statements
Developing the branch and bound method in the problem of searching for the optimal cyclic route (cyclic rural postman problem) (English)
0 references
24 October 2014
0 references
branch and bound method
0 references
traveling salesman problem
0 references
postman problem
0 references
0.7916902899742126
0 references
0.7905758023262024
0 references
0.7686208486557007
0 references
