Ulrich Pferschy
Univ.Doz. Dipl.-Ing. Dr.techn.
Role
-
Affiliated
Algorithms and Complexity, E192-01
Publications
- The multidimensional knapsack problem: Structure and algorithms / Puchinger, J., Raidl, G., & Pferschy, U. (2010). The multidimensional knapsack problem: Structure and algorithms. INFORMS Journal on Computing, 22(2), 250–265. http://hdl.handle.net/20.500.12708/167303
- Accelerating column generation for a survivable network design problem / Leitner, M., Raidl, G., & Pferschy, U. (2009). Accelerating column generation for a survivable network design problem. In Proceedings of the International Network Optimization Conference 2009 (p. 8). http://hdl.handle.net/20.500.12708/52688
- A Directed Cut Model for the Design of the Last Mile in Real-World Fiber Optic Networks / Wagner, D., Pferschy, U., Mutzel, P., Raidl, G., & Bachhiesl, P. (2007). A Directed Cut Model for the Design of the Last Mile in Real-World Fiber Optic Networks. In Proceedings of the International Network Optimization Conference 2007. International Network Optimization Conference, Spa, Belgien, EU. http://hdl.handle.net/20.500.12708/51928
- A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks. / Wagner, D., Raidl, G., Pferschy, U., Mutzel, P., & Bachhiesl, P. (2007). A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks. In Operations Research Proceedings 2006, Karlsruhe. Operations Research, Karlsruhe, Deutschland, EU. Springer. http://hdl.handle.net/20.500.12708/51766
- The core concept for the multidimensional knapsack problem. / Puchinger, J., Raidl, G., & Pferschy, U. (2006). The core concept for the multidimensional knapsack problem. In J. Gottlieb & G. Raidl (Eds.), Evolutionary Computation in Combinatorial Optimization - EvoCOP 2006, volume 3906 of LNCS (pp. 195–208). Springer. http://hdl.handle.net/20.500.12708/51759
- Solving the prize-collecting Steiner tree problem to optimality. / Ljubic, I., Weiskircher, R., Pferschy, U., Klau, G. W., Mutzel, P., & Fischetti, M. (2005). Solving the prize-collecting Steiner tree problem to optimality. In Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO). ALENEX 2005 (Seventh Workshop on Algorithm Engineering and Experiments), Vancouver, Kanada, Non-EU. SIAM. http://hdl.handle.net/20.500.12708/51229
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. / Ljubic, I., Weiskircher, R., Pferschy, U., Klau, G. W., Mutzel, P., & Fischetti, M. (2005). An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Mathematical Programming, 105(2–3), 427–449. http://hdl.handle.net/20.500.12708/173363
- Solving the prize-collecting Steiner tree problem to optimality. / Ljubic, I., Weiskircher, R., Pferschy, U., Klau, G. W., Mutzel, P., & Fischetti, M. (2004). Solving the prize-collecting Steiner tree problem to optimality. http://hdl.handle.net/20.500.12708/33020
- The fractional prize-collecting Steiner tree problem on trees / Weiskircher, R., Klau, G. W., Ljubic, I., Mutzel, P., & Pferschy, U. (2003). The fractional prize-collecting Steiner tree problem on trees. http://hdl.handle.net/20.500.12708/32937
Supervisions
-
On solving constrained tree problems and an adaptive layers framework
/
Ruthmair, M. (2012). On solving constrained tree problems and an adaptive layers framework [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-54456
Download: PDF (1.19 MB) -
On the minimum label spanning tree problem : solution methods and applications
/
Chwatal, A. M. (2010). On the minimum label spanning tree problem : solution methods and applications [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-30618
Download: PDF (927 KB) -
Solving two network design problems by mixed integer programming and hybrid optimization methods
/
Leitner, M. (2010). Solving two network design problems by mixed integer programming and hybrid optimization methods [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-36359
Download: PDF (772 KB) -
Hybrid optimization methods for warehouse logistics and the reconstruction of destroyed paper documents
/
Prandtstetter, M. (2009). Hybrid optimization methods for warehouse logistics and the reconstruction of destroyed paper documents [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-32849
Download: PDF (3.36 MB) -
Exact and heuristic approaches for solving the bounded diameter minimum spanning tree problem
/
Gruber, M. (2009). Exact and heuristic approaches for solving the bounded diameter minimum spanning tree problem [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-24552
Download: PDF (1.22 MB) -
Hybrid metaheuristics for generalized network design problems
/
Hu, B. (2008). Hybrid metaheuristics for generalized network design problems [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-24387
Download: PDF (676 KB) -
Combining metaheuristics and integer programming for solving cutting and packing problems
/
Puchinger, J. (2005). Combining metaheuristics and integer programming for solving cutting and packing problems [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-21487
Download: PDF (764 KB) -
Exact and memetic algorithms for two network design problems
/
Ljubić, I. (2004). Exact and memetic algorithms for two network design problems [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-13664
Download: PDF (10 MB)