Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation (Q342082): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Knapsack / rank | |||
Normal rank | |||
Revision as of 07:00, 28 February 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
