Wildlife corridors as a connected subgraph problem (Q456412): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The Steiner problem with edge lengths 1 and 2 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solving Connected Subgraph Problems in Wildlife Conservation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the hardness of approximating minimum vertex cover / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal Selection of a Connected Reserve Network / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5689037 / rank | |||
Normal rank | |||
Revision as of 19:03, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Wildlife corridors as a connected subgraph problem |
scientific article |
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
