On imposing connectivity constraints in integer programs

Full Length Paper Series A

Abstract

In many network applications, one searches for a connected subset of vertices that exhibits other desirable properties. To this end, this paper studies the connected subgraph polytope of a graph, which is the convex hull of subsets of vertices that induce a connected subgraph. Much of our work is devoted to the study of two nontrivial classes of valid inequalities. The first are the ab-separator inequalities, which have been successfully used to enforce connectivity in previous computational studies. The second are the indegree inequalities, which have previously been shown to induce all nontrivial facets for trees. We determine the precise conditions under which these inequalities induce facets and when each class fully describes the connected subgraph polytope. Both classes of inequalities can be separated in polynomial time and admit compact extended formulations. However, while the ab-separator inequalities can be lifted in linear time, it is NP-hard to lift the indegree inequalities.

Keywords

Connected subgraph polytope Maximum-weight connected subgraph Connectivity constraints Prize-collecting Steiner tree Contiguity 

Mathematics Subject Classification

90B10 90B18 90C10 90C27 90C35 90C57 68R10 

References

  1. 1.
    Álvarez-Miranda, E., Ljubić, I., Mutzel, P.: The maximum weight connected subgraph problem. In: Jünger, M., Reinelt, G. (eds.) Facets of Combinatorial Optimization, pp. 245–270. Springer, Berlin (2013)CrossRefGoogle Scholar
  2. 2.
    Álvarez-Miranda, E., Ljubić, I., Mutzel, P.: The rooted maximum node-weight connected subgraph problem. In: Gomes, C., Sellmann, M. (eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Lecture Notes in Computer Science, vol. 7874, pp. 300–315. Springer, Berlin (2013)Google Scholar
  3. 3.
    Backes, C., Rurainski, A., Klau, G., Müller, O., Stöckel, D., Gerasch, A., Küntzer, J., Maisel, D., Ludwig, N., Hein, M., et al.: An integer linear programming approach for finding deregulated subgraphs in regulatory networks. Nucl. Acids Res. 40(6), e43 (2012)CrossRefGoogle Scholar
  4. 4.
    Bailly-Bechet, M., Borgs, C., Braunstein, A., Chayes, J., Dagkessamanskaia, A., François, J.M., Zecchina, R.: Finding undetected protein associations in cell signaling by belief propagation. Proc. Nat. Acad. Sci. 108(2), 882–887 (2011)CrossRefGoogle Scholar
  5. 5.
    Biha, M., Kerivin, H., Ng, P.: Polyhedral study of the connected subgraph problem. Discrete Math. 338(1), 80–92 (2015)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Buchanan, A., Sung, J., Butenko, S., Pasiliao, E.: An integer programming approach for fault-tolerant connected dominating sets. INFORMS J. Comput. 27(1), 178–188 (2015)CrossRefMATHGoogle Scholar
  7. 7.
    Carvajal, R., Constantino, M., Goycoolea, M., Vielma, J., Weintraub, A.: Imposing connectivity constraints in forest planning models. Oper. Res. 61(4), 824–836 (2013)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Chen, C.Y., Grauman, K.: Efficient activity detection with max-subgraph search. In: Computer Vision and Pattern Recognition (CVPR), 2012 IEEE Conference on, pp. 1274–1281. IEEE (2012)Google Scholar
  9. 9.
    Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2010)Google Scholar
  10. 10.
    Dittrich, M., Klau, G., Rosenwald, A., Dandekar, T., Müller, T.: Identifying functional modules in protein-protein interaction networks: an integrated exact approach. Bioinformatics 24(13), i223–i231 (2008)CrossRefGoogle Scholar
  11. 11.
    Du, D.Z., Wan, P.: Connected Dominating Set: Theory and Applications. Springer Optimization and Its Applications, vol. 77. Springer, New York (2013)CrossRefMATHGoogle Scholar
  12. 12.
    Eppstein, D.: When does a graph admit an orientation in which there is at most one \(s\)\(t\) walk? Theoretical computer science stack exchange. http://cstheory.stackexchange.com/questions/31412/when-does-a-graph-admit-an-orientation-in-which-there-is-at-most-one-s-t-walk (version: 2015-05-07)
  13. 13.
    Fischetti, M., Leitner, M., Ljubić, I., Luipersbeck, M., Monaci, M., Resch, M., Salvagnin, D., Sinnl, M.: Thinning out Steiner trees: a node-based model for uniform edge costs. Math. Prog. Comp. 1–27 (2016). doi:10.1007/s12532-016-0111-0
  14. 14.
    Garfinkel, R., Nemhauser, G.: Optimal political districting by implicit enumeration techniques. Manag. Sci. 16(8), B-495 (1970)CrossRefMATHGoogle Scholar
  15. 15.
    Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics, vol. 2, 2nd edn. Springer, Berlin (1993)CrossRefMATHGoogle Scholar
  16. 16.
    Johnson, D.: The NP-completeness column: an ongoing guide. J. Algorithms 6(1), 145–159 (1985)MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Korte, B., Lovász, L., Schrader, R.: Greedoids, Algorithms and Combinatorics, vol. 4. Springer, Berlin (1991)MATHGoogle Scholar
  18. 18.
    Ljubić, I., Weiskircher, R., Pferschy, U., Klau, G., Mutzel, P., Fischetti, M.: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Math. Program. 105(2–3), 427–449 (2006)MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Lucena, A., Resende, M.: Strong lower bounds for the prize collecting Steiner problem in graphs. Discrete Appl. Math. 141(1), 277–294 (2004)MathSciNetCrossRefMATHGoogle Scholar
  20. 20.
    Moody, J., White, D.: Structural cohesion and embeddedness: a hierarchical concept of social groups. Am. Sociol. Rev. 68(1), 103–127 (2003)CrossRefGoogle Scholar
  21. 21.
    Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization, Discrete Mathematics and Optimization, vol. 18. Wiley, New York (1988)MATHGoogle Scholar
  22. 22.
    Papadimitriou, C., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover Publications, Mineola (1998)MATHGoogle Scholar
  23. 23.
    Raghavan, S., Magnanti, T.: Network connectivity. In: Dell’Amico, M., Maffioli, F., Martello, S. (eds.) Annotated Bibliographies in Combinatorial Optimization, pp. 335–354. Wiley, New York (1997)Google Scholar
  24. 24.
    Rajagopalan, S., Vazirani, V.: On the bidirected cut relaxation for the metric Steiner tree problem. SODA 99, 742–751 (1999)MathSciNetMATHGoogle Scholar
  25. 25.
    Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, Algorithms and Combinatorics, vol. 24. Springer, Berlin (2003)MATHGoogle Scholar
  26. 26.
    Vijayanarasimhan, S., Grauman, K.: Efficient region search for object detection. In: Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on, pp. 1401–1408. IEEE (2011)Google Scholar
  27. 27.
    Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications, Strutural Analysis in the Social Sciences, vol. 8. Cambridge University Press, New York (1994)CrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society 2017

Authors and Affiliations

  1. 1.Department of Industrial and Systems EngineeringTexas A&M UniversityCollege StationUSA
  2. 2.School of Industrial Engineering & ManagementOklahoma State UniversityStillwaterUSA

Personalised recommendations