A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs (Q1025987): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2008.02.014 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2008.02.014 / rank | |||
Normal rank | |||
Latest revision as of 13:33, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs |
scientific article |
Statements
A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs (English)
0 references
23 June 2009
0 references
Lagrangian relaxation
0 references
non delayed relax-and-cut
0 references
prize-collecting Steiner problem in graphs
0 references
0 references
0 references
