Wildlife corridors as a connected subgraph problem (Q456412)
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: Wildlife corridors as a connected subgraph problem |
scientific article; zbMATH DE number 6098446
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Wildlife corridors as a connected subgraph problem |
scientific article; zbMATH DE number 6098446 |
Statements
Wildlife corridors as a connected subgraph problem (English)
0 references
25 October 2012
0 references
wildlife corridors
0 references
habitat fragmentation
0 references
optimization
0 references
mixed integer programming
0 references
computational sustainability
0 references
0.82767653465271
0 references
0.789435088634491
0 references
0.7547863721847534
0 references
0.7476025819778442
0 references
0.7397331595420837
0 references
