A branch-and-cut algorithm for the maximum covering cycle problem (Q2288980)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut algorithm for the maximum covering cycle problem |
scientific article |
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
