An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem (Q2242188)
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 effective branch-and-bound algorithm for the maximum s-bundle problem |
scientific article; zbMATH DE number 7422880
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem |
scientific article; zbMATH DE number 7422880 |
Statements
An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem (English)
0 references
9 November 2021
0 references
branch and bound
0 references
combinatorial optimization
0 references
graph theory
0 references
clique relaxation
0 references
\(s\)-bundle
0 references
0 references
0 references
0 references
0.7444270849227905
0 references
0.7371726036071777
0 references
0.7289057374000549
0 references
