Advertisement

Abstract

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.

Keywords

Master Problem Wildlife Conservation Steiner Tree Problem Connectivity Constraint Single Commodity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Benders, J.: Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4, 238–252 (1962)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Conrad, J., Gomes, C.P., van Hoeve, W.-J., Sabharwal, A., Suter, J.: Connections in networks: Hardness of feasibility versus optimality. In: Van Hentenryck, P., Wolsey, L.A. (eds.) CPAIOR 2007. LNCS, vol. 4510, pp. 16–28. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  3. 3.
    Costa, A.M., Cordeau, J.-F., Laporte, G.: Steiner tree problems with profits. INFOR: Information Systems and Operational Research 4(2), 99–115 (2006)MathSciNetGoogle Scholar
  4. 4.
    Costa, A.M., Cordeau, J.-F., Laporte, G.: Models and branch-and-cut algorithms for the steiner tree problem with revenues, budget and hop constraints. Networks 53(2), 141–159 (2009)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Dantzig, G., Fulkerson, R., Johnson, S.: Solution of a Large-Scale Traveling-Salesman Problem. Operations Research 2(4), 393–410 (1954)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Demaine, E.D., Hajiaghayi, M.T., Klein, P.: Node-weighted steiner tree and group steiner tree in planar graphs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555. Springer, Heidelberg (2009)Google Scholar
  7. 7.
    Gomes, C.P., van Hoeve, W.-J., Sabharwal, A.: Connections in networks: A hybrid approach. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol. 5015, pp. 303–307. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  8. 8.
    ILOG, SA, CPLEX 11.0 Reference Manual (2007)Google Scholar
  9. 9.
    Lee, H.F., Dooly, D.R.: Decomposition algorithms for the maximum-weight connected graph problem. Naval Research Logistics 45(8), 817–837 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Levin, A.: A better approximation algorithm for the budget prize collecting tree problem. Operations Research Letters 32(4), 316–319 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Ljubic, I., Weiskircher, R., Pferschy, U., Klau, G.W., Mutzel, P., Fischetti, M.: Solving the prize-collecting steiner tree problem to optimality. In: ALENEX/ANALCO, pp. 68–76 (2005)Google Scholar
  12. 12.
    McDaniel, D., Devine, M.: A Modified Benders’ Partitioning Algorithm for Mixed Integer Programming. Management Science 24(3), 312–319 (1977)zbMATHCrossRefGoogle Scholar
  13. 13.
    Moss, A., Rabani, Y.: Approximation algorithms for constrained node weighted steiner tree problems. SIAM J. Comput. 37(2), 460–481 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Williams, J.C., Snyder, S.A.: Restoring habitat corridors in fragmented landscapes using optimization and percolation models. Environmental Modeling and Assessment 10(3), 239–250 (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  1. 1.Department of Computer ScienceCornell UniversityIthacaU.S.A.

Personalised recommendations