Strong formulations for 2-node-connected steiner network problems

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

Volumn 5165 LNCS, Issue , 2008, Pages 190-200

  Chimani, Markus ^a   Kandyba, Maria ^a   Ljubić, Ivana ^b   Mutzel, Petra ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

^b UNIVERSITY OF VIENNA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

BEVERAGES; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; CUSTOMER SATISFACTION; GRAPH THEORY; OPTIMIZATION; SALES;

DIRECTED GRAPHS; EXPERIMENTAL STUDIES; INTERNATIONAL CONFERENCES; MINIMUM WEIGHT; MULTI-COMMODITY FLOWS; NODE PARTITION; OPTIMALITY; STEINER NETWORK; STRONG FORMULATIONS; SUB GRAPHS; SURVIVABLE NETWORK DESIGN; WEIGHTED UNDIRECTED GRAPH;

SET THEORY;

EID: 51849128684     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85097-7_18     Document Type: Conference Paper

References (25)

1. Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)
2. Cherkassky, B.V., Goldberg, A.V.: On implementing push-relabel method for the maximum flow problem. Algorithmica 19, 390-410 (1997)
3. Chimani, M., Kandyba, M., Ljubić, I., Mutzel, P.: Strong formulations for the 2-node-connected steiner network problems (tr). Technical Report TR07-1-008, Chair for Algorithm Engineering, TU Dortmund (November 2007)
4. Chimani, M., Kandyba, M., Ljubić, I., Mutzel, P.: Obtaining optimal k-cardinality trees fast. In: Proc. Siam ALENEX 2008 (2008)
5. Chimani, M., Kandyba, M., Mutzel, P.: A new ILP formulation for 2-root-connected prize-collecting Steiner networks. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 681-692. Springer, Heidelberg (2007)
6. Chopra, S.: Polyhedra of the equivalent subgraph problem and some edge connectivity problems. SIAM J. Discrete Math. 5(3), 321-337 (1992)
7. Ghashghai, E., Rardin, R.L.: Using a hybrid of exact and genetic algorithms to design survivable networks. Computers & OR 29(1), 53-66 (2002)
8. Goemans, M.X.: Analysis of linear programming relaxations for a class of connectivity problems. PhD thesis. MIT, Cambridge (1990)
9. 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)
10. Grötschel, M., Monma, C.L., Stoer, M.: Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints. Operatios Research 40(2), 309-330 (1992)
11. Grötschel, M., Monma, C.L., Stoer, M.: Facets for polyhedra arising in the design of communication networks with low-connectivity constraints. SIAM Journal on Optimization 2(3), 474-504 (1992)
12. 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)
13. Kerivin, H., Mahjoub, A.R.: Design of survivable networks: A survey. Networks 46(1), 1-21 (2005)
14. Ljubić, I.: Exact and Memetic Algorithms for Two Network Design Problems. PhD thesis, TU Vienna (2004)
15. 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. Prog. Ser. B 105(2-3), 427-449 (2006)
16. 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)
17. Magnanti, T.L., Raghavan, S.: Strong formulations for network design problems with connectivity requirements. Networks 45(2), 61-79 (2005)
18. Polzin, T., Daneshmand, S.V.: Improved algorithms for the Steiner problem in networks. Discrete Applied Mathematics 112(1-3), 263-300 (2001)
19. Raghavan, S.: Formulations and Algorithms for the Network Design Problems with Connectivity Requirements. PhD thesis. MIT, Cambridge(1995)
20. Robbins, H.E.: A theorem on graphs with an application to a problem of traffic control. American Mathematical Monthly 46, 281-283 (1939)
21. Stoer, M.: Design of Survivable Networks. LNM, vol. 1531. Springer, Heidelberg (1992)
22. Wagner, D.: Generierung und Adaptierung von Testinstanzen für das OPT und SST Problem. Technical Report 03/2007, Carinthia Tech Institute, Klagenfurt, Austria (2007) (in German)
23. Wagner, D., Raidl, G.R., Pferschy, U., Mutzel, P., Bachhiesl, P.: A multicommodity flow approach for the design of the last mile in real-world fiber optic networks. In: Proc. OR 2006, pp. 197-202. Springer, Heidelberg (2006)
24. Winter, P.: Steiner problem in networks: A survey. Networks 17(2), 129-167 (1987)
25. Wolsey, L.A.: Integer Programming. Wiley-Interscience, Chichester (1998)