A branch and cut algorithm for minimum spanning trees under conflict constraints (Q2257077): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: 1307.1424 / rank | |||
Normal rank |
Revision as of 03:56, 19 April 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