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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)