A branch-and-cut algorithm for the median-path problem (Q2490367)
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: A branch-and-cut algorithm for the median-path problem |
scientific article; zbMATH DE number 5021422
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for the median-path problem |
scientific article; zbMATH DE number 5021422 |
Statements
A branch-and-cut algorithm for the median-path problem (English)
0 references
2 May 2006
0 references
path-location
0 references
median-path
0 references
branch-and-cut
0 references
0 references
0.7849329113960266
0 references
0.7688050270080566
0 references
0.7646820545196533
0 references
0.7537593841552734
0 references
0.7537593841552734
0 references
