Wildlife corridors as a connected subgraph problem.

Wildlife corridors connect areas of biological significance to mitigate the negative ecological impacts of habitat fragmentation. In this article we formalize the optimal corridor design as a connected subgraph problem, which maximizes the amount of suitable habitat in a fully connected parcel netwo...

Descripción completa

Detalles Bibliográficos
Publicado en:Journal of Environmental Economics & Management Vol. 63; no. 1; pp. 1 - 19
Autores principales: Conrad, Jon M., Gomes, Carla P., van Hoeve, Willem-Jan, Sabharwal, Ashish, Suter, Jordan F.
Formato: Artículo
Publicado: Academic Press Inc. January 2012
Acceso en línea:Ver este registro en EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=ssf&AN=527588173&site=ehost-live
header:
  @attributes:
    shortDbName: ssf
    uiTerm: 527588173
    longDbName: Social Sciences Full Text (H.W. Wilson)
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00950696
        EEM
      jtl: Journal of Environmental Economics & Management
      issn: 00950696
      maglogo: N
    pubinfo:
      dt: January 2012
      vid: 63
      iid: 1
      pid: 735
      pub: Academic Press Inc.
    artinfo:
      ui:
        527588173
        10.1016/j.jeem.2011.08.001
      ppf: 1
      ppct: 18
      formats:
      tig:
        atl: Wildlife corridors as a connected subgraph problem.
      aug:
        au:
          Conrad, Jon M.
          Gomes, Carla P.
          van Hoeve, Willem-Jan
          Sabharwal, Ashish
          Suter, Jordan F.
      ab: Wildlife corridors connect areas of biological significance to mitigate the negative ecological impacts of habitat fragmentation. In this article we formalize the optimal corridor design as a connected subgraph problem, which maximizes the amount of suitable habitat in a fully connected parcel network linking core habitat areas, subject to a constraint on the funds available for land acquisition. To solve this challenging computational problem, we propose a hybrid approach that combines graph algorithms with Mixed Integer Programming-based optimization. We apply this technique to the design of corridors for grizzly bears in the U.S. Northern Rockies, illustrating the underlying computational complexities by varying the granularity of the parcels available for acquisition. The approach that is introduced is general and can be applied to other species or other similar problems, such as those occurring in social networks.
      pubtype: Academic Journal
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: N
    holdings:
      @attributes:
        islocal: N