A branch-and-cut algorithm for the maximum covering cycle problem (Q2288980)
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 maximum covering cycle problem |
scientific article; zbMATH DE number 7153646
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for the maximum covering cycle problem |
scientific article; zbMATH DE number 7153646 |
Statements
A branch-and-cut algorithm for the maximum covering cycle problem (English)
0 references
20 January 2020
0 references
covering problems
0 references
branch-and-cut
0 references
optimal cycle problems
0 references
domination problems
0 references
0 references
0 references
0 references
0.91950923
0 references
0.91839856
0 references
0.91225106
0 references
0.9077469
0 references
0.90688574
0 references
0.9013746
0 references
0.89768356
0 references
0.89768356
0 references
0.89654875
0 references
