The tree-star problem: a formulation and a branch-and-cut algorithm (Q325465): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Ring Star Problem: Polyhedral analysis and exact algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reformulations and solution algorithms for the maximum leaf spanning tree problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Strong lower bounds for the prize collecting Steiner problem in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm / rank | |||
Normal rank | |||
Revision as of 17:42, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The tree-star problem: a formulation and a branch-and-cut algorithm |
scientific article |
Statements
The tree-star problem: a formulation and a branch-and-cut algorithm (English)
0 references
18 October 2016
0 references
tree-star problem
0 references
formulation
0 references
branch-and-cut algorithm
0 references
0 references
