An efficient cutting plane algorithm for the minimum weighted elementary directed cycle problem in planar digraphs (Q2826672)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6640433
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient cutting plane algorithm for the minimum weighted elementary directed cycle problem in planar digraphs |
scientific article; zbMATH DE number 6640433 |
Statements
An efficient cutting plane algorithm for the minimum weighted elementary directed cycle problem in planar digraphs (English)
0 references
18 October 2016
0 references
0 references
0 references
0 references
0.7760358452796936
0 references
0.750100314617157
0 references
0.7383034229278564
0 references
0.7367181181907654
0 references
