Searching for a cycle with maximum coverage in undirected graphs (Q331987)
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: Searching for a cycle with maximum coverage in undirected graphs |
scientific article; zbMATH DE number 6644662
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Searching for a cycle with maximum coverage in undirected graphs |
scientific article; zbMATH DE number 6644662 |
Statements
Searching for a cycle with maximum coverage in undirected graphs (English)
0 references
27 October 2016
0 references
maximum covering cycle
0 references
constraint generation
0 references
integer programming
0 references
heuristics
0 references
0.890550434589386
0 references
0.7966766953468323
0 references
0.7904642224311829
0 references
0.7693197131156921
0 references
