A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs (Q1025987)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs |
scientific article; zbMATH DE number 5569102
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs |
scientific article; zbMATH DE number 5569102 |
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
