A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs (Q1025987): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2008.02.014 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2058433703 / rank | |||
Normal rank | |||
Revision as of 00:04, 20 March 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
