35 search results - page 1 / 7 » Solving Connected Subgraph Problems in Wildlife Conservation |
CPAIOR
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We investigate mathematical formulations and solution techniques for a variant of the Connected Subgraph Problem. Given a connected graph with costs and profits associat...
CPAIOR
2008
Springer
13 years 6 months ago
2008
Springer
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
AAAI
2011
12 years 4 months ago
2011
The conservation of wildlife corridors between existing habitat preserves is important for combating the effects of habitat loss and fragmentation facing species of concern. We in...
CPAIOR
2011
Springer
12 years 8 months ago
2011
Springer
We introduce the Upgrading Shortest Paths Problem, a new combinatorial problem for improving network connectivity with a wide range of applications from multicast communication to ...
IPCO
2004
13 years 6 months ago
2004
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...