A branch and cut algorithm for minimum spanning trees under conflict constraints (Q2257077): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: LEMON / rank | |||
Normal rank | |||
Revision as of 08:11, 29 February 2024
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
