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 this page instead for the normal view: An efficient cutting plane algorithm for the minimum weighted elementary directed cycle problem in planar digraphs |
scientific article; zbMATH DE number 6640433
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
