Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation (Q342082)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6654048
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation |
scientific article; zbMATH DE number 6654048 |
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
0.9170475006103516
0 references
0.8821729421615601
0 references
0.8156877756118774
0 references
0.8149468302726746
0 references
