Strength of Three MIP Formulations for the Prize Collecting Steiner Tree Problem with a Quota Constraint (Q2883603): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:31, 3 February 2024
scientific article
| 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 |
Statements
Strength of Three MIP Formulations for the Prize Collecting Steiner Tree Problem with a Quota Constraint (English)
0 references
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
