Upgrading shortest paths in networks
CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Solving connected subgraph problems in wildlife conservation
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Automated configuration of mixed integer programming solvers
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Parallel algorithm configuration
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Automatically configuring algorithms for scaling performance
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Ordered racing protocols for automatically configuring algorithms for scaling performance
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Bayesian optimization in high dimensions via random embeddings
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Algorithm runtime prediction: Methods & evaluation
Artificial Intelligence
| Hi-index | 0.00 |
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.