A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems (Q5131733): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q57705346, #quickstatements; #temporary_batch_1712688784189 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57705346 / rank | |||
Normal rank | |||
Latest revision as of 21:25, 9 April 2024
scientific article; zbMATH DE number 7271646
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems |
scientific article; zbMATH DE number 7271646 |
Statements
A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems (English)
0 references
9 November 2020
0 references
Steiner trees
0 references
prize-collecting Steiner trees
0 references
dual ascent
0 references
reduction tests
0 references
branch-and-bound
0 references
