Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem (Q953318): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57705378, #quickstatements; #temporary_batch_1707161894653 |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: POPMUSIC / rank | |||
Normal rank | |||
Revision as of 11:06, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem |
scientific article |
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
