Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem (Q953318)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem |
scientific article; zbMATH DE number 5366817
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem |
scientific article; zbMATH DE number 5366817 |
Statements
Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem (English)
0 references
17 November 2008
0 references
generalized minimum spanning tree
0 references
variable neighborhood search
0 references
dynamic programming
0 references
integer linear programming
0 references
0 references
0 references
0.8267646431922913
0 references
0.8267377018928528
0 references
0.8248378038406372
0 references
0.8163241744041443
0 references
