A new method to solve the fully connected reserve network design problem (Q2356224): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q58645874, #quickstatements; #temporary_batch_1714786519576 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Requiring connectivity in the set covering problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Wildlife corridors as a connected subgraph problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Multiobjective programming methods in the reserve selection problem. / 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: A graph theory approach for designing conservation reserve networks with minimal fragmentation / rank | |||
Normal rank | |||
Revision as of 13:41, 10 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new method to solve the fully connected reserve network design problem |
scientific article |
Statements
A new method to solve the fully connected reserve network design problem (English)
0 references
29 July 2015
0 references
reserve network design problem
0 references
site selection
0 references
mixed integer programming
0 references
contiguity
0 references
compactness
0 references
spatial optimisation
0 references
