The rooted maximum node-weight connected subgraph problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7874 LNCS, Issue , 2013, Pages 300-315

  Álvarez Miranda, Eduardo ^a   Ljubić, Ivana ^b   Mutzel, Petra ^c  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF VIENNA   (Austria)

^c TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH-AND-CUT; COMPUTATIONAL STUDIES; CONNECTED SUBGRAPH; INTEGER LINEAR PROGRAMMING FORMULATION; NETWORK DESIGN PROBLEMS; NON NEGATIVES; STEINER ARBORESCENCE; SYSTEM BIOLOGY;

ARTIFICIAL INTELLIGENCE; BUDGET CONTROL; COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CONSTRAINT THEORY; INTEGER PROGRAMMING; OPERATIONS RESEARCH;

GRAPH THEORY;

EID: 84892935170     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-38171-3_20     Document Type: Conference Paper

References (15)

1. Backes, C., Rurainski, A., Klau, G., Müller, O., Stöckel, D., Gerasch, A., Küntzer, J., Maisel, D., Ludwig, N., Hein, M., Keller, A., Burtscher, H., Kaufmann, M., Meese, E., Lenhof, H.: An integer linear programming approach for finding deregulated subgraphs in regulatory networks. Nucleic Acids Research 1, 1-13 (2011)
2. Carvajal, R., Constantino, M., Goycoolea, M., Vielma, J.P., Weintraub, A.: Imposing connectivity constraints in forest planning models (2011) (submitted)
3. Chen, S., Ljubić, I., Raghavan, S.: The generalized regenerator location problem (2012) (submitted)
4. Conrad, J.M., Gomes, C.P., van Hoeve, W.-J., Sabharwal, A., Suter, J.F.: Wildlife corridors as a connected subgraph problem. Journal of Environmental Economics and Management 63(1), 1-18 (2012)
5. Dilkina, B., Gomes, C.: Solving connected subgraph problems in wildlife conservation. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 102-116. Springer, Heidelberg (2010)
6. Dilkina, B., Gomes, C.: Synthetic corridor problem generator (2012), http://www.cs.cornell.edu/~bistra/connectedsubgraph.htm
7. 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, i223-i231 (2008)
8. Fügenschuh, A., Fügenschuh, M.: Integer linear programming models for topology optimization in sheet metal design. Mathematical Methods of Operations Research 68(2), 313-331 (2008)
9. Johnson, D.S., Minkoff, M., Phillips, S.: The prize-collecting Steiner tree problem: Theory and practice. In: Proc. 11th ACM-SIAM Symp. Discrete Algorithms, SODA 2000, San Francisco, USA, January 9-11, pp. 760-769 (2000)
10. Kaparis, K., Letchford, A.N.: Separation algorithms for 0-1 knapsack polytopes. Mathematical Programming 124(1-2), 69-91 (2010)
11. Koch, T., Martin, A.: Solving Steiner tree problems in graphs to optimality. Networks 32, 207-232 (1998)
12. Lee, H., Dooly, D.: Decomposition algorithms for the maximum-weight connected graph problem. Naval Research Logistics 45, 817-837 (1998)
13. Ljubić, I.: Exact and Memetic Algorithms for Two Network Design Problems. PhD thesis, Vienna University of Technology (2004)
14. 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. Mathematical Programming, Series B 105, 427-449 (2006)
15. Moss, A., Rabani, Y.: Approximation algorithms for constrained node weighted Steiner tree problems. SIAM J. Comput. 37(2), 460-481 (2007)