参考文献
[1] J. E. Beasley(ed.), Advances in Linear and Integer Programming, Oxford University Press, 1996.
[2] I. Bongartz, A. Conn, N. Gould and Ph. L. Toint, CUTE: Constrained and Unconstrained Testing Environment, Research Report RC 18860, IBM, T. J. Watson Research Center, Yorktown, U.S.A., 1993.
[3] V・フバータル著/阪田省二朗・藤野和建訳，線形計画法（上/下），啓学出版，1983.
[4] I. S. Duff and J. K. Reid, The Multifrontal solution of indefinite sparse symmetric linear systems, ACM Transaction on Mathematical Software, Vol.9,No.3 ,302-325,1983.
[5] P. E. Gill, W. Murray, M.A.Saunders and M.H.Wright, A practical anti-cycling procedure for linearly constrained optimization, Mathematical Programming, 45:437-474, 1989.
[6] P. E. Gill, W. Murray, M. A. Saunders and M. H. Wright, Inertia-controlling methods for general quadratic programming, SIAM Review, 33:1-36, 1991.
[7] W. Hock and K. Shittkowski, Test examples for nonlinear programming codes, Springer Verlag, 1981.
[8] 田辺隆人，山下浩，主双対外点法とそのパラメトリック最適化への応用，2005 年日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集50-51.
[9] K. Nonobe and T. Ibaraki, A tabu search approach for the constraint satisfaction problem as a general problem solver, European Journal of Operational Research 106, 599-623, 1998.
[10] K. Nonobe and T. Ibaraki, An improved tabu search method for the weighted constraint satisfaction problem, INFOR 39, 131-151, 2001.
[11] 伊理正夫，今野浩，刀根薫監訳，最適化ハンドブック，朝倉書店，1995.
[12] 矢部博，八巻直一，非線形計画法，朝倉書店，1999．
[13] H. Yamashita, A globally convergent primal-dual interior point method for constrained optimization, Optimization Methods and Software, Vol. 10, 443-469, 1998.
[14] H. Yamashita, H. Yabe and T. Tanabe, A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization, Mathematical Programming vol. 102, 111-151 2005.
[15] H. Yamashita and H. Yabe, Superlinear and quadratic convergence of some primal-dual interior point methods for constrained optimization, Mathematical Programming vol. 75, 377-397 1996.
[16] K. Nonobe and T. Ibaraki, Formulation and tabu search algorithm for the resource constrained project scheduling problem, in: C.C. Ribeiro and P. Hansen (eds.): Essays and Surveys in Metaheuristics, Kluwer Academic Publishers, pp.557-588, 2002.
[17] T. Ralphs, et al., Parallel solvers for mixed integer linear optimization, In Handbook of parallel constraint reasoning, Springer, 2018, pp. 283-336.
[18] Y. Shinano, et al., Solving open MIP instances with ParaSCIP on supercomputers using up to 80,000 cores. In: Parallel and Distributed Processing Symposium, 2016 IEEE International. IEEE. 2016, pp. 770-779.
[19] S. Umetani, Exploiting variable associations to configure efficient local search in large-scale set partitioning problems, Twenty-Ninth AAAI Conference on Artificial Intelligence, February 2015.
[20] Maros, István. Computational techniques of the simplex method. Vol. 61. Springer Science & Business Media, 2002.
[21] Munguía, LM., Ahmed, S., Bader, D.A. et al. Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs. Comput Optim Appl 69, 1–24 (2018).
上に戻る