Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems
SIAM Journal on Computing
Connections in Networks: Hardness of Feasibility Versus Optimality
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Networks - Special Issue on Trees
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Connections in networks: a hybrid approach
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
A better approximation algorithm for the budget prize collecting tree problem
Operations Research Letters
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
Primal-dual approximation algorithms for node-weighted steiner forest on planar graphs
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Primal-dual approximation algorithms for Node-Weighted Steiner Forest on planar graphs
Information and Computation
| Hi-index | 0.00 |
We investigate mathematical formulations and solution techniques for a variant of the Connected Subgraph Problem. Given a connected graph with costs and profits associated with the nodes, the goal is to find a connected subgraph that contains a subset of distinguished vertices. In this work we focus on the budget-constrained version, where we maximize the total profit of the nodes in the subgraph subject to a budget constraint on the total cost. We propose several mixed-integer formulations for enforcing the subgraph connectivity requirement, which plays a key role in the combinatorial structure of the problem. We show that a new formulation based on subtour elimination constraints is more effective at capturing the combinatorial structure of the problem, providing significant advantages over the previously considered encoding which was based on a single commodity flow. We test our formulations on synthetic instances as well as on real-world instances of an important problem in environmental conservation concerning the design of wildlife corridors. Our encoding results in a much tighter LP relaxation, and more importantly, it results in finding better integer feasible solutions as well as much better upper bounds on the objective (often proving optimality or within less than 1% of optimality), both when considering the synthetic instances as well as the real-world wildlife corridor instances.