Author:
Commander Clayton W.,Pardalos Panos M.,Ryabchenko Valeriy,Uryasev Stan,Zrazhevsky Grigoriy
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference12 articles.
1. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York
2. Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 5:533–549
3. Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison–Wesley, Reading
4. Holton G (2003) Value-at-risk: theory and practice. Academic, San Diego
5. King J (1994) Three problems in search of a measure. Am Math Mon 101:609–628
Cited by
47 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献