A new method to solve the fully connected reserve network design problem (Q2356224): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2013.05.015
+Normal rank
@@ Property / OpenAlex ID @@
+W2042558818
@@ Property / OpenAlex ID: W2042558818 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q58645874
@@ Property / Wikidata QID: Q58645874 / rank @@
+Normal rank
@@ Property / cites work @@
+Requiring connectivity in the set covering problem
+Normal rank
@@ Property / cites work @@
+Wildlife corridors as a connected subgraph problem
+Normal rank
@@ Property / cites work @@
+Multiobjective programming methods in the reserve selection problem.
+Normal rank
@@ Property / cites work @@
+Optimal Selection of a Connected Reserve Network
@@ Property / cites work: Optimal Selection of a Connected Reserve Network / rank @@
+Normal rank
@@ Property / cites work @@
+A graph theory approach for designing conservation reserve networks with minimal fragmentation
+Normal rank