Strength of three MIP formulations for the prize collecting Steiner tree problem with a quota constraint (Q2883603)
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: Strength of three MIP formulations for the prize collecting Steiner tree problem with a quota constraint |
scientific article; zbMATH DE number 6033961
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strength of three MIP formulations for the prize collecting Steiner tree problem with a quota constraint |
scientific article; zbMATH DE number 6033961 |
Statements
13 May 2012
0 references
Steiner tree
0 references
MTZ subtour elimination constraints
0 references
reformulation-linearization technique
0 references
mixed integer programming
0 references
0 references
0 references
0 references
Strength of three MIP formulations for the prize collecting Steiner tree problem with a quota constraint (English)
0 references
