Abstract
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 drastically reduces the cost of testing for infeasibility and also helps prune the search space for MIP-based optimization. Overall, this provides a much more scalable solution than simply optimizing a MIP model of the problem with Cplex. We report results for semi-structured lattice instances as well as on real data used for the construction of a wildlife corridor for grizzly bears in the Northern Rockies region. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Gomes, C. P., Van Hoeve, W. J., & Sabharwal, A. (2008). Connections in networks: A hybrid approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5015 LNCS, pp. 303–307). https://doi.org/10.1007/978-3-540-68155-7_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
