1. Arora, S., Karger, D., Karpinski, M.: Polynomial Time Approximation Schemes for Dense Instances of NP-hard Problems. In: Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pp. 284–293. ACM Press, New York (1995)
2. CPLEX 8.1 ILOG SA, France (2004),
http://www.ilog.com/products/cplex
3. Crescenzi, P., Kann, V.: A compendium of NP optimization problems (2005),
http://www.nada.kth.se/~viggo/problemlist/compendium.html
4. LNEMS;J.R. Daduna,1995
5. Engelhardt-Funke, O., Kolonko, M.: Analysing stability and investments in railway networks using advanced evolutionary algorithms. International Transactions in Operational Research 11, 381–394 (2004)