A new ILP formulation for 2-root-connected prize-collecting steiner networks

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

Volumn 4698 LNCS, Issue , 2007, Pages 681-692

  Chimani, Markus ^a   Kandyba, Maria ^a   Mutzel, Petra ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; CONSTRAINT THEORY; GRAPH THEORY; KNOWLEDGE BASED SYSTEMS; PROBLEM SOLVING;

MULTI-COMMODITY FLOW; NODE-DISJOINTNESS CONSTRAINTS; STEINER NETWORKS;

REAL TIME SYSTEMS;

EID: 38049087653     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75520-3_60     Document Type: Conference Paper

References (21)

1. Bachhiesl, P.: The OPT- and the SST-problems for real world access network design - basic definitions and test instances. Working Report NetQuest 01/2005, Carinthia Tech Institute, Klagenfurt, Austria (2005)
2. Bachhiesl, P.: The OPT- standard problem, solvers, and results. Working Report NetQuest 02/2005, Carinthia Tech Institute, Klagenfurt, Austria (2005)
3. Canuto, S.A., Resende, M.G.C., Ribeiro, C.C.: Local search with perturbations for the prize-collecting steiner tree problem in graphs. Networks 38(1), 50-58 (2001)
4. Chimani, M., Kandyba, M., Mutzcl, P.: A new ILP formulation for a 2-connected prize collecting steiner network problem (tr). Technical Report TR07-1-001, Chair for Algorithm Engineering, Dep. of CS, University Dortmund (2007)
5. Chopra, S.: The equivalent subgraph and directed cut polyhedra on series-parallel graphs. SIAM J. Discrete Math. 5(4), 475-490 (1992)
6. Goemans, M.X.: Analysis of linear programming relaxations for a class of connectivity problems, PhD thesis, Massachusetts Institute of Technology, Cambridge, MA (1990)
7. Grötschel, M., Monma, C.L., Stoer, M.: Polyhedral Approaches to Network Survivability. In: Reliability of Computer and Communication Networks, Proc. Workshop 1989. Discrete Mathematics and Theoretical Computer Science, vol. 5, pp. 121-141. American Mathematical Society (1991)
8. Johnson, D.S., Minkoff, M., Phillips, S.: The prize-collecting steiner tree problem: Theory and practice. In: Proceedings of 11th ACM-SIAM Symposium on Distcrete Algorithms, San Fransisco, CA, pp. 760-769 (2000)
9. Kerivin, H., Mahjoub, A.R.: Design of survivable networks: A survey, networks 46(1), 1-21 (2005)
10. Ljubic, I.: Exact and Memetic Algorithms for Two Network Design Problems. PhD thesis, Technische Universität Wien (2004)
11. Ljubic, 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(2-3), 427-449 (2006)
12. Lucena, A., Resende, M.G.C.: Strong lower bounds for the prize-collecting steiner problem in graphs. Discrete Applied Mathematics 141(1-3), 277-294 (2003)
13. Magnanti, T.L., Raghavan, S.: Strong formulations for network design problems with connectivity requirements. Networks 45(2), 61-79 (2005)
14. Nash-Williams, C.: On orientations, connectivity and odd-vertex pairings in finite graphs. Canad. J. Math. 12, 555-567 (1960)
15. Robbins, H.E.: A theorem on graphs with an application to a problem of traffic control. American Mathematical Monthly 46, 281-283 (1939)
16. Steiglitz, K., Weigner, P., Kleitman, D.J.: The design of minimum-cost survivable networks. IEEE Trans Circuit Theory 16, 455-460 (1969)
17. Stoer, M.: Design of Survivable Networks. Lecture Notes in Mathematics, vol. 1531. Springer, Heidelberg (1992)
18. Wagner, D., Raidi, G.R., Pferschy, U., Mutzel, P., Bachhiesl, P.: A multi-commodity flow approach for the design of the last mile in real-world fiber optic networks. In: Operations Research Proceedings 2006, Springer, Heidelberg (2006)
19. Wagner, D., Raidl, G.R., Pferschy, U., Mutzel, P., Bachhiesl, P.: A Directed Cut for the Design of the Last Mile in Real-World Fiber Optic Networks. In: Proceedings of the International Network Optimization Conference 2007 (2007)
20. Winter, P.: Steiner problem in networks: A survey. networks 17(2), 129-167 (1987)
21. Wolsey, L.A.: Integer Programming. Wiley-Interscience, New York, USA (1998)