Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation (Q342082): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2015.06.005 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2015.06.005 / rank | |||
Normal rank | |||
Latest revision as of 00:10, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation |
scientific article |
Statements
Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation (English)
0 references
17 November 2016
0 references
quadratic minimum spanning tree problem
0 references
Lagrangian relaxation
0 references
reformulation-linearization technique
0 references
lower bound
0 references
dual-ascent approach
0 references
reduced costs
0 references
0 references
0 references
0 references
