A branch and cut algorithm for minimum spanning trees under conflict constraints (Q2257077)
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 minimum spanning trees under conflict constraints |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and cut algorithm for minimum spanning trees under conflict constraints |
scientific article |
Statements
A branch and cut algorithm for minimum spanning trees under conflict constraints (English)
0 references
23 February 2015
0 references
optimal trees
0 references
conflict constraints
0 references
stable set
0 references
branch and cut
0 references
