Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem (Q953318): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10732-007-9047-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2163148176 / rank | |||
Normal rank | |||
Revision as of 23:12, 19 March 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
