Author:
Minami Kazuhiro,Tanjo Tomoya,Arizumi Nana,Maruyama Hiroshi,Murakami Daisuke,Yamagata Yoshiki
Publisher
Springer International Publishing
Reference19 articles.
1. Aarts, E., & Korst, J. (1988). Simulated annealing and Boltzmann machines: A stochastic approach to combinatorial optimization and neural computing. New York: Wiley.
2. Arizumi, N., Minami, K., Tanjo, T., Maruyama, H., Murakami, D., & Yamagata, Y. (2014). A first step towards resilient graph partitioning for electrical grids. In Proceedings of the 7th International Conference on Information and Automation for Sustainability (ICIAfS) (pp. 1–6). IEEE. doi: 10.1109/ICIAFS.2014.7069608
3. Berger, M. J., & Bokhari, S. H. (1987). A partitioning strategy for nonuniform problems on multiprocessors. IEEE Transactions on Computers, 100, 570–580.
4. Bui, T. N., & Jones, C. (1993). A heuristic for reducing fill-in in sparse matrix factorization. In Proceedings of the 6th SIAM Conference on Parallel Processing for Scientific Computing (pp. 445–452).
5. Edmonds, J., & Karp, R. M. (1972). Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM, 19(2), 248–264. doi: 10.1145/321694.321699 , url: http://doi.acm.org/10.1145/321694.321699