Strength of Three MIP Formulations for the Prize Collecting Steiner Tree Problem with a Quota Constraint (Q2883603): 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.endm.2010.05.063 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2067501168 / rank | |||
Normal rank |
Revision as of 00:46, 20 March 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