Wildlife corridors as a connected subgraph problem (Q456412): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jeem.2011.08.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027469956 / rank
 
Normal rank
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
    0 references
    0 references
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references