OR学会各賞 歴代受賞者

加藤直樹氏は，ORの主要な分野である数理最適化，アルゴリズムや計算機科学における理論的な研究，ならびにORの諸手法を建築やデータマイニング分野などに適用した研究において顕著な業績を残してきた．加藤氏の主要な研究業績として，計算幾何学や組合せ最適化の分野での理論的な貢献が挙げられる．また，加藤氏の応用的研究は非常に多岐に渡るとともに，様々な教科書を執筆しており，最適化を中心とするOR的手法の他分野へ拡大に関して多大な貢献を果たした．日本オペレーションズ・リサーチ学会においては，副会長，編集理事，関西支部長等を歴任し，文献賞，事例研究賞，業績賞を受賞している．

室田一雄氏は，数値計算法(数値積分，線形計算)，マトロイド理論のシステム解析への応用，群論的分岐理論の構造工学への応用，計算幾何学，経済地理学・空間経済学など数理工学の様々な分野に渡って，優れた研究成果を挙げると共に，数々の著書を通じて，数理工学の教育・普及に多大な貢献をしてきた．特に離散凸解析という分野を創始し，最近の25年間に渡って主導的な立場で研究を進めている．
室田一雄氏は，2014年に第15回業績賞を受賞しており，数理工学の様々な分野で顕著な業績を挙げてきたことが高く評価されている．2014年から2年間は副会長を務めるなど，日本オペレーションズ・リサーチ学会の発展にも寄与している．また，東京大学，京都大学，筑波大学，東京都立大学において長年教育に携わり，企業・教育機関等に多くの優秀な人材を輩出し，オペレーションズ・リサーチ分野の人材育成に大きく貢献している．

山下浩氏は，オペレーションズ・リサーチにおける理論と実践の両立を身をもって示した稀有の存在である．1982年4月に（株）数理システム（現（株）NTTデータ数理システム）を設立し，数理科学とコンピュータサイエンスを活用してさまざまな現実問題を解決する日本有数の技術力をもった企業に育て上げた．その一方で，研究者として非線形最適化と数理モデリングの研究を行い，その研究成果を国際学術誌に論文として発表するとともに，数理計画法ソフトウェアNUOPT（現Numerical Optimizer）を通じて社会に還元してきた．
これらの業績により，山下氏は，2004年に日本オペレーションズ・リサーチ学会業績賞を受賞し，同学会のフェローにも列せられている．また，数理システム（2013年より商号変更によりNTTデータ数理システム）は， 1999年および2016年に同学会実施賞を受賞している．さらに，他学会からもその業績を認められ，日本計算機 統計学会貢献賞を2回受賞している．

田口東氏は，30数年間にわたり，現実社会の課題にORの手法を適用する，OR本来の実用研究を実践してきた．現実のデータに基づく精緻なモデル化を行い，ORの高度な手法を駆使して解決策を導き社会へフィードバックするという，氏の一貫した研究スタイルにより，田園都市線の遅れの原因の究明，東日本大震災地域におけるバス時刻表の提案，東京オリンピック観戦客輸送の混雑分析など，意義のある事例研究を数多く発表し，ORの有用性を世の中に知らしめた．
また，「都市のOR」研究会では中心的な役割を果たし，都市や地域の現象に関する諸問題にOR手法を適用する新しい研究分野を確立し，多くの研究者が集う活気ある分野に成長させた功績は大きい．
本学会においても，庶務理事，理事OR誌編集委員長，副会長を歴任し，学会の発展に大いに貢献した．

福島雅夫氏は，非線形計画法を中心として，変分不等式問題や相補性問題などの均衡問題の研究に取り組み，200編を超える学術論文を発表し，日本を代表する研究者として，世界的に高い評価を得ている．また，京都大学，奈良先端科学技術大学院大学において，多くの優れた研究者を育成するとともに，中国，香港，米国などの著名研究者とともにPacific Optimization Research Activity Groupを立ち上げ，その会長を務め，Pacific Journal of Optimization誌を発行し，その編集長を務めるなど，アジア太平洋地域における数理最適化分野の発展に中心的な役割を果たしてきた．また，15誌にも及ぶ国際学術雑誌の編集に携わるなど，その功績は極めて大きい．
本学会では，数理計画専門部会（RAMP）主査，論文誌編集委員を務めるなど，学会の発展に多大な貢献をされている．

藤重悟氏は，数理計画法における劣モジュラ関数の分野で多くの卓越した研究業績をあげてきた．最大の業績は，劣モジュラ関数の理論の体系化であり，多面体理論を通じて劣モジュラ関数を研究する枠組みを確立したことである．数理計画法における離散最適化問題の多くは，何らかの意味で劣モジュラ関数に関連しており，藤重氏は数理計画法における最も基礎的な部分の進歩に貢献したと言える．
藤重氏が著した論文は90篇を越え，世界的に権威のある学術誌に掲載されている．著書も多く，それらを通じて離散最適化やマトロイドの理論に目を開かれた若い人々は多い．今日の離散最適化の分野において，世界に通用する研究者が日本から多数輩出されているのは，藤重氏の貢献によるところが大きい．
本学会においては，平成20年度から2年間，編集担当理事・論文誌編集委員長を勤め，本学会論文誌の充実に尽力した．

宮沢氏は，待ち行列・応用確率論の分野における理論面を中心とした研究で多くの卓越した行政を挙げられ，海外の研究者との共同研究の成果も多く，世界をリードするトップクラスの研究者として知られている．宮沢氏が著した英文論文は80篇を数え，世界的に権威のある学術誌に掲載されている．
主要な研究テーマは，1980年代前半から90年代前半までは，点過程を用いた待ち行列のモデル化とその応用，1990年代後半からは，待ち行列ネットワークに関する研究，2000年代に入ってからは，非積形式ネットワークモデルにおける定常分布の解析で，他の研究者の多くの研究を刺激している．
本学会「待ち行列」研究部会で30年間にわたり研究をリードしてこられ，内外の学術雑誌の編集者としても活躍されている．

小島氏は，およそ40年間にわたって，数理計画法の分野で，世界をリードする研究活動を続けてこられた．研究テーマは，初期の相補性問題に始まり，不動点問題に対するホモトピー法，内点法，半正定値計画法，大域的最適化，多項式計画問題など多岐にわたるが，特筆すべき業績として次の3つを挙げることができる．
・不動点における狭義安定性の概念の非線形計画法への導入
・線形計画問題における双対内点法の設計と線形相補性問題への拡張
・半正定値計画問題に対する主・双対内点法の設計とソフトウェアSDPAの開発
以上の研究業績に加えて，卓越した研究指導力によって，多くの優れた研究者を育てた功績も特筆すべきものがある．

茨木氏は40年間にわたって，組合せ最適化，離散数学に関する研究を中心に，ORとその周辺分野で400編を超える学術論文を発表され，日本を代表する研究者として世界的に高い評価を獲得されている．
また，京都大学，豊橋技術科学大学，関西学院大学において多くの後継者を育てられるとともに，20誌に及ぶ国際学術雑誌の編集に携わり，イリノイ大学，ウォータールー大学，サイモン・フレーザー大学，ラトガース大学などの客員教授も務めている．
本学会においても，各種委員，理事，評議員，代議員，副会長などを歴任され，その発展に多大な貢献をされている．

[1] Y. Kobayashi, “Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles,” Mathematical Programming, B, 192, pp. 675—702, 2022.
[2] S. Iwata and Y. Kobayashi, “A weighted linear matroid parity algorithm,” SIAM Journal on Computing, 51, pp. 238—280, 2022.
[3] K. Kawarabayashi and Y. Kobayashi, “Linear min-max relation between the treewidth of an H-minor-free graph and its largest grid minor,” Journal of Combinatorial Theory, B, 141, pp. 165—180, 2020.
[4] Y. Kobayashi, “NP-hardness and fixed-parameter tractability of the minimum spanner problem,” Theoretical Computer Science, 746, pp. 88—97, 2018.
[5] K. Kawarabayashi and Y. Kobayashi, “All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs,” SIAM Journal on Computing, 47, pp. 1483—1504, 2018.

[1] M. Nishihara, “Target-initiated takeover with search frictions,” European Journal of Operational Research, 305, pp. 1480—1497, 2023.
[2] M. Nishihara and T. Shibata, “Optimal capital structure and simultaneous bankruptcy of firms in corporate networks,” Journal of Economic Dynamics and Control, 133, 104264, 2021.
[3] M. Nishihara and T. Shibata, “The effects of asset liquidity on dynamic sell-out and bankruptcy decisions,” European Journal of Operational Research, 288, pp. 1017—1035, 2021.
[4] M. Nishihara and T. Shibata, “Liquidation, fire sales, and acquirers’ private information,” Journal of Economic Dynamics and Control, 108, 103769, 2019.
[5] T. Shibata and M. Nishihara, “Investment timing, reversibility, and financing constraints,” Journal of Corporate Finance, 48, pp. 771—796, 2018.

[1] R. Oba and S. Tanigawa, Characterizing the universal rigidity of generic tensegrities, Mathematical Programming, 掲載決定済み.
[2] K. Clinch, B. Jackson and S. Tanigawa, Abstract 3-rigidity and bivariate C_2^1-splines II: combinatorial characterization, Discrete Analysis, 2022:3 (2022), 1–31.
[3] T. Jordan and S. Tanigawa, Global rigidity of triangulations with braces, Journal of Combinatorial Theory, Series B, 136 (2019), 249–288.
[4] S. Fujishige and S. Tanigawa, Polynomial combinatorial algorithms for skew-bisubmodular function minimization, Mathematical Programming, 171 (2018), 87–114.
[5] S. Tanigawa, Singularity degree of the positive semidefinite matrix completion problem, SIAM Journal on Optimization, 27 (2017), 986–1009.

[1] S. Kijima, N. Shimizu and T. Shiraga, “How many vertices does a random walk miss in a network with moderately increasing the number of vertices?,”
[2] T. Fujii and S. Kijima, “Every finite distributive lattice is isomorphic to the minimizer set of an M♮-concave set function,”
[3] E. Ando and S. Kijima, “An FPTAS for the volume of some V-polytopes — It is hard to compute the volume of the intersection of two cross-polytopes,”
[4] J. Nakashima, Y. Yamauchi, S. Kijima and M. Yamashita, “Finding submodularity hidden in symmetric difference,”
[5] S. Kijima, K. Koga and K. Makino, “Deterministic random walks on finite graphs, Random Structures & Algorithms,”

［1］ P. Carmi, M. K. Chiu, M. J. Katz, M. Korman, Y. Okamoto, A. van Renssen, M. Roeloffzen, T. Shiitada and S. Smorodinsky, “Balanced line separators of unit disk graphs,”
［2］ T. Ito, N. Kakimura, N. Kamiyama, Y. Kobayashi and Y. Okamoto, “Minimum-cost b-edge dominating sets on trees,”
［3］ T.  Ito,  N.  Kakimura,  N.  Kamiyama,  Y.  Kobayashi  and  Y.  Okamoto,  “Efficient  stabilization  of cooperative matching games,”
［4］ S. Iwata, N. Kamiyama, N. Katoh, S. Kijima and Y. Okamoto, “Extended formulations for sparsity matroids,”
［5］ M. Cygan, H. Dell, D. Lokshtanov, D. Marx, J. Nederlof, Y. Okamoto, R. Paturi, S. Saurabh and M. Wahlström, “On problems as hard as CNF-SAT,”

[1] Iiduka, H. (2018). Distributed Optimization for Network Resource Allocation with Nonsmooth Utility Functions.
[2] Iiduka, H. (2016). Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings.
[3] Iiduka, H. (2016). Proximal point algorithms for nonsmooth convex optimization with fixed point constraints.
[4] Iiduka, H. (2015). Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping.
[5] Iiduka, H., & Hishinuma, K. (2014). Acceleration method combining broadcast and incremental distributed optimization algorithms.

[1] T. Koch, T. Ralphs, Y. Shinano. Could we use a million cores to solve an integer program?
[2] Y. Shinano, T. Achterberg, T. Berthold, S. Heinz, T. Koch, M.Winkler. Solving hard MIPLIB2003 problems with ParaSCIP on supercomputers: An update.
[3] G. Gamrath, T. Koch, S. J. Maher, D. Rehfeldt, Y. Shinano. SCIP-Jack – A solver for STP and variants with parallelization extensions.
[4] Y. Shinano, T. Achterberg, T. Berthold, S. Heinz, T. Koch, M. Winkler: Solving open MIP instances with ParaSCIP on supercomputers using up to 80,000 cores.
[5] Y. Shinano, S. Heinz, S.Vigerske, M.Winkler. FiberSCIP – A shared memory parallelization of SCIP.

[1] H. Masuyama. “Tail asymptotics for cumulative processes sampled at heavy-tailed random times with applications to queueing models in Markovian environments,”
[2] H. Masuyama. “Error bounds for augmented truncations of discrete-time block-monotone Markov chains under geometric drift conditions,”
[3] H. Masuyama. “A sufficient condition for the subexponential asymptotics of GI/G/1-type Markov chains with queueing applications,”
[4] H. Masuyama. “Error bounds for augmented truncations of discrete-time block-monotone Markov chains under subgeometric drift conditions,”
[5] H. Masuyama. “Continuous-time block-monotone Markov chains and their block-augmented truncations,”

［1］ J. Gotoh, and A. Takeda. “Minimizing loss probability bounds for portfolio selection,”
［2］ J. Gotoh, K. Shinozaki, and A. Takeda. “Robust portfolio techniques for mitigating the fragility of CVaR minimization and generalization to coherent risk measures,”
［3］ A. Takeda, M. Niranjan, J. Gotoh and Y. Kawahara. “Simultaneous pursuit of out-of-sample performance and sparsity in index tracking portfolios,”
［4］ J. Gotoh, and S. Uryasev. “Two pairs of families of polyhedral norms versus lp-norms: proximity and applications in optimization,”
［5］ J. Gotoh, and S. Uryasev. “Support vector machines based on convex risk functions and general norms,”

[1] A. Takeda, H. Mitsugi and T. Kanamori: A unified classification model based on robust optimization,
[2] S. Okido and A. Takeda: Economic and environmental analysis of photovoltaic energy systems via robust optimization,
[3] A. Barbero, A. Takeda and J. Lopez: Geometric intuition and algorithms for Eν-SVM
[4] D. Bertsimas and A. Takeda: Optimizing over coherent risk measures and non-convexities: a robust mixed integer optimization approach,
[5] S. Iwata, Y. Nakatsukasa and A. Takeda: Computing the signed distance between overlapping ellipsoids,

[1] “Tree metrics and edge-disjoint S-paths”,
[2] “Discrete Convexity and Polynomial Solvability in Minimum 0-Extension Problems”,
[3] “Bounded fractionality of the multiflow feasibility problem for demand graph K3+K3 and related maximization problems”,
[4] “Folder complexes and multiflow combinatorial dualities”,
[5] “Metric packing for K3+K3”,

[1] High-Performance General Solver for Extremely Large-Scale Semidefinite Programming Problems,
[2] Convex Optimization Approaches to Maximally Predictable Portfolio Selection Optimization:
[3] The Second-order Reduced Density Matrix Method and the Two-dimensional Hubbard Model,
[4] NETAL: High-performance Implementation of Network Analysis Library Considering Computer Memory Hierarchy,
[5] A Performance Characteristics of Graph500 on Large-Scale Distributed Environment,

[1] M-convex Function Minimization by Continuous Relaxation Approach: Proximity Theorem and Algorithm. Satoko Moriguchi, Akiyoshi shioura, and Nobuyuki Tsuchimura
[2] Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility under Budget Constraints. Akiyoshi Shioura
[3] Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra. Akiyoshi Shioura
[4] New Algorithms for Convex Cost Tension Problem with Application to Computer Vision. Vladimir Kolmogorov and Akiyoshi Shioura
[5] Polynomial-time Algorithms for Linear and Convex Optimization on Jump Systems. Akiyoshi Shioura and Ken’ichiro Tanaka

１．安定マッチングの戦略的操作可能性に関する研究;“Cheating Strategies for the Gale-Shapley Algorithm with Complete Preference Lists,”
“Successful Manipulation in Stable Marriage Model with Complete Preference Lists,”
２．グラフの多重彩色数に関する研究; “Perfectness and Imperfectness of Unit Disk Graphs on Triangular Lattice Points,”
３．多次元割り当て問題のアルゴリズムに関する研究; “An Approximation Algorithm for Multidimensional Assignment Problems Minimizing the Sum of Squared Errors,”
４．２行分割表を生成するパーフェクトサンプリング法に関する研究；“Polynomial Time Perfect Sampling Algorithm for Two-Rowed Contingency Tables,”

[1] K. Kobayashi and Y. Takano, “A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems,” Computational Optimization and Applications, 75, pp. 493—513, 2020.
[2] K. Kobayashi, Y. Takano and K. Nakata, “Bilevel cutting-plane algorithm for solving cardinality-constrained mean-CVaR portfolio optimization,” Journal of Global Optimization, 81, pp. 493—528, 2021.
[3] K. Kobayashi, Y. Takano and K. Nakata, “Cardinality-constrained distributionally robust portfolio optimization,” European Journal of Operational Research, 309, pp. 1173—1182, 2023.

[1] J. Zheng, H. Okamura and T. Dohi, “Sensitivity analysis for a Markov regenerative software rejuvenation model,” Stochastic Models, 2022 (latest articles).
[2] J. Zheng, H. Okamura and T. Dohi, “Age replacement with Markovian opportunity process,” Reliability Engineering & System Safety, 216, 107949, 2021.
[3] J. Zheng, H. Okamura, T. Dohi and K. S. Trivedi, “Quantitative security evaluation of intrusion tolerant systems with Markovian arrivals,” IEEE Transactions on Reliability, 70, pp. 547—562, 2021.

[1] T. Liu, I. Markovsky, T. K. Pong and A. Takeda, “A hybrid penalty method for a class of optimization problems with multiple rank constraints,” SIAM Journal on Matrix Analysis, 41, pp. 1260—1283, 2020.
[2] T. Liu and A. Takeda, “An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems,” Computational Optimization and Applications, 82, pp. 141—173, 2022.
[3] T. Liu and B. F. Lourenço, “Convergence analysis under consistent error bounds,” Foundations of Computational Mathematics, 2022 (latest articles).

[1] M. Chakraborty, A. Igarashi, W. Suksompong and Y. Zick, Weighted envy-freeness in indivisible item allocation, ACM Transactions on Economics and Computation, 9 (2021), pages 1–39.
[2] X. Bei, A. Igarashi, X. Lu, and W. Suksompong, The price of connectivity in fair division, SIAM Journal on Discrete Mathematics, 36 (2022), pages 1156–1186.
[3] H. Goko, A. Igarashi, Y. Kawase, K. Makino, H. Sumita, A. Tamura, Y. Yokoi and M. Yokoo, Fair and truthful allocation with limited subsidy, Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, IFAAMAS, 2022, pages 534–542.

[1] H. Hirai, Y. Iwamasa, K. Murota and S. Živný, A tractable class of binary VCSPs via M-convex intersection, ACM Transactions on Algorithms, 15 (2019), 44:1–44:41.
[2] H. Hirai and Y. Iwamasa, A combinatorial algorithm for computing the rank of a generic partitioned matrix with 2×2 submatrices, Mathematical Programming, Series A, 掲載決定済み.
[3] Y. Iwamasa, A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with 2×2 submatrices, Proceedings of the
22nd Conference on Integer Programming and Combinatorial Optimization, LNCS 12707, 119–133, 2021.

[1] M. Tanaka and T. Okuno, Extension of the LP-Newton method to conic programming problems via semi-infinite representation, Numerical Algorithms, 86 (2021), 1285–1302.
[2] R. Sato, M. Tanaka and A. Takeda, A gradient method for multilevel optimization, Advances in Neural Information Processing Systems, 34 (2021), 7522–7533.
[3] M. Toyoda and M. Tanaka, Fast iterative method for SOAV minimization problem with linear equality and box constraints and its linear convergence, Journal of The Franklin Institute, 359 (2022), 2206–2228.

[1] H. Jeon, Investment and financing decisions in the presence of time-to-build, European Journal of Operational Research, 288 (2021), 1068–1084.
[2] H. Jeon, Investment timing and capacity decisions with time-to-build in a duopoly market, Journal of Economic Dynamics and Control, 122 (2021), 104028.
[3] H. Jeon, Licensing and information disclosure under asymmetric information, European Journal of Operational Research, 276 (2019), 314–330.

[1] M. Ito and M. Fukuda, Nearly optimal first-order methods for convex optimization under gradient norm measure: An adaptive regularization approach, Journal of Optimization Theory and Applications, 188 (2021), 770-804.
[2] M. Ito and B. F. Lourenço, The automorphism group and the non-self-duality of p-cones, Journal of Mathematical Analysis and Applications, 471 (2019), 392-410.
[3] M. Ito and B. F. Lourenço, A bound on the Carathéodory number, Linear Algebra and its Applications, 532 (2017), 347-363.

[1] Y. Yokoi, Envy-free matchings with lower quotas, Algorithmica, 82 (2020), 188-211.
[2] S. Iwata and Y. Yokoi, Finding a stable allocation in polymatroid intersection, Mathematics of Operations Research, 45 (2020), 63-85.
[3] Y. Yokoi, Matroidal choice functions, SIAM Journal on Discrete Mathematics, 33 (2019), 1712-1724.

［1］ R. Benkoczi, B. Bhattacharya, Y. Higashikawa, T. Kameda and N. Katoh, “Minsum k-Sink Problem on Path Networks, ” Theoretical Computer Science, 806, pp. 388–401, 2020.
［2］ B. Bhattacharya, Y. Higashikawa, T. Kameda and N. Katoh, “An O（n2 log2 n）Time Algorithm for Minmax Regret Minsum Sink on Path Networks,” In 29th International Symposium on Algorithms and Computation（ISAAC 2018），Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2018.
［3］ Y.  Hanawa,  Y.  Higashikawa,  N.  Kamiyama,  N.  Katoh  and  A.  Takizawa,  “The  Mixed  Evacuation Problem,” Journal of Combinatorial Optimization, 36, pp. 1299–1314, 2018.

［1］ N. Sukegawa, “An asymptotically improved upper bound on the diameter of polyhedra,” Discrete & Computational Geometry, 62, pp. 690–699, 2019.
［2］ T. Kitahara and N. Sukegawa, “A simple projection algorithm for linear programming problems,” Algorithmica, 81, pp. 167–178, 2019.
［3］ N. Nishimura, N. Sukegawa, Y. Takano and J. Iwanaga, “A latent-class model for estimating product- choice probabilities from clickstream data,” Information Sciences, 429, pp. 406–420, 2018.

［1］ Y. Inoue, O. Boxma, D. Perry and S. Zacks, “Analysis of Mx/G/1 queues with impatient customers,” Queueing Systems, 89, pp. 303–350, 2018.
［2］ Y. Inoue, “Comparison results for M/G/1 queues with waiting and sojourn time deadlines,” Journal of Applied Probability, 56, pp. 524–532, 2019.
［3］ Y. Inoue, H. Masuyama, T. Takine and T. Tanaka, “A general formula for the stationary distribution of the age of information and its application to single-server queues,” IEEE Transactions on Information Theory, 65, pp. 8305–8324, 2019.

［1］ A. Miyauchi and A. Takeda, “Robust densest subgraph discovery,” In Proceedings of the 18th IEEE International Conference on Data Mining（ICDM 2018）, pp. 1188–1193, 2018.
［2］ A. Miyauchi and N. Kakimura, “Finding a dense subgraph with sparse cut,” In Proceedings of the 27th ACM International Conference on Information and Knowledge Management（CIKM 2018）, pp. 547– 556, 2018.
［3］ A. Miyauchi, T. Sonobe and N. Sukegawa, “Exact clustering via integer programming and maximum satisfiability,” In Proceedings of the 32nd AAAI Conference on Artificial Intelligence（AAAI 2018）, pp. 1387–1394, 2018.

[1] Sato, H. (2016). A Dai-Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions. Computational Optimization and Applications, 64(1), 101-118.
[2] Sato, H. (2017). Riemannian Newton-type methods for joint diagonalization on the Stiefel manifold with application to independent component analysis. Optimization, 66(12), 2211-2231.
[3] Sato, H., & Aihara, K. (2019). Cholesky QR-based retraction on the generalized Stiefel manifold. Computational Optimization and Applications, 72(2), 293-308.

[1] Colin Cooper, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga, “Fast plurality consensus in regular expanders, ” in Proceedings of the 31st International Symposium on Distributed Computing (DISC 2017), 13:1-13:16，2017.
[2] Colin Cooper, Andrew McDowell, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga, “Dispersion processes, ” Random Structures and Algorithms, 53(4), 561-585, 2018.
[3] Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita, “Deterministic random walks for rapidly mixing chains, ” SIAM Journal on Discrete Mathematics, 32(3), 2180-2193, 2018.

[1] Bruno F. Lourenco, Masakazu Muramatsu, and Takashi Tsuchiya. Facial Reduction and Partial Polyhedrality, SIAM Journal on Optimization, 28 (2018), 2304-2326.
[2] Bruno F. Lourenco, Tomonari Kitahara, Masakazu Muramatsu, and Takashi Tsuchiya. An extension of Chubanov’s algorithm to symmetric cones, Mathematical Programming, 173 (2019), 117-149.
[3] Bruno F. Lourenco, Ellen H. Fukuda, and Masao Fukushima. Optimality Conditions for Nonlinear Semidefinite Programming via Squared Slack Variables, Mathematical Programming, 168 (2018), 177-200.

［1］ S. Iwata and M. Takamatsu. “On the Kronecker canonical form of singular mixed matrix pencils,” SIAM Journal on Control and Optimization, vol. 55, pp. 2134–2150, 2017.
［2］ T. Yamauchi, M. Takamatsu and S. Imahori. “Optimizing train stopping patterns for congestion management,” Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems （ATMOS）, no. 13 （15 pages）, 2017.
［3］ M. Takamatsu and A. Taguchi. “Train and bus timetable design to ensure smooth transfer in areas with low-frequency public transportation services,” Proceedings of the 6th International Conference on Railway Operations Modelling and Analysis, no. 34 （20 pages）, 2015.

［1］　Y. Kawase, K. Makino, and K. Seimi, “Optimal composition ordering problems for piecewise linear functions,” The 27th International Symposium on Algorithms and Computation （ISAAC2016）, LIPICS64（ 2016） 42:1–42:13.
［2］　X. Han, Y. Kawase, and K. Makino, “Randomized algorithms for online knapsack problems,” Theoretical Computer Science, 562（2015）, pp. 395–405.
［3］　Y. Kawase. “The secretary problem with a choice function,” The 26th International Symposium on Algorithms and Computation （ISAAC2015）, LNCS 9472 （2015）, pp. 129–139.

［1］ Y. Sasaki. “An equivalence result on the reduction of games with unawareness,” International Game Theory Review, 18（2016）, 1650009 （27 pages）.
［2］ Y. Sasaki. “Generalized Nash equilibrium with stable belief hierarchies in static games with unawareness,” Annals of Operations Research（ 2016）.（ In Press, オンライン版公開済み）
［3］ Y. Sasaki, R. P. Hämäläinen, and E. Saarinen. “Modeling systems of holding back as hypergames and their connections with systems intelligence,” Systems Research and Behavioral Science, 32（2015）, pp. 93–602.

[1] Naoki Katoh and Shin-ichi Tanigawa: Rooted-tree decompositions with matroid constraints and the infinitesimal rigidity of frameworks with boundaries, SIAM Journal on Discrete Mathematics, 27(2013), 155-185.
[2] Shin-ichi Tanigawa: Matroids of gain graphs in applied discrete geometry, Transactions of the American Mathematical Society, 367(2015), 8597-8641.
[3] Shin-ichi Tanigawa: Sufficient conditions for globally rigidity of graphs, Journal of Combinatorial Theory, Series B, 113(2015), 123-140.

[1] Kawasaki, R.: Roth-Postlewaite stability and von Neumann-Morgenstern stability, Journal of Mathematical Economics, 58(2015), 1-6.
[2] Kawasaki, R.: Maximin, minimax, and von Neumann-Morgenstern farsighted stable sets, Mathematical Social Sciences, 74(2015), 8-12.
[3] Yamamura, H. and R. Kawasaki :Generalized average rules as stable Nash mechanisms to implement generalized median　 rules, Social Choice and Welfare, 40(2013), 815-832.

[1] E. H. Fukuda and L. M. Grana Drummond: Inexact projected gradient method for vector optimization, Computational Optimization and Applications, 54(2013) , 473-493.
[2] R. Andreani, E. H. Fukuda, and P. J. S. Silva: A Gauss-Newton approach for solving constrained optimization problems using differentiable exact penalties, Journal of Optimization Theory and Applications, 156 (2013), 417-449.
[3] E. H. Fukuda, P. J. S. Silva, and M. Fukushima: Differentiable exact penalty functions for nonlinear second-order cone programs, SIAM Journal on Optimization, 22 (2012), 1607-1633.

[1] T. Okuno, and M. Fukushima: Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints, Journal of Global Optimization, 60 (2014), 25-48.
[2] H. Yamaura, T. Okuno, S. Hayashi, and M. Fukushima: A smoothing SQP method for mathematical programming with linear second-order cone complementarity constraints, Pacific Journal of Optimization, 9 (2013) , 345-372.
[3] T. Okuno, S. Hayashi, and M. Fukushima: A regularized explicit exchange method for semi-infinite programs with an infinite number of conic constraints, SIAM Journal on Optimization, 22 (2012), 1009-1028.

[1] K. Bando: On the existence of a strictly strong Nash equilibrium under the student-optimal deferred acceptance algorithm, Games and Economic Behavior, 87 (2014), 269-287.
[2] K. Bando: A modified deferred acceptance algorithm for many-to-one matching markets with externalities among firms, Journal of Mathematical Economics, 52 (2014), 173-181.
[3] K. Bando: Many-to-one matching markets with externalities among firms, Journal of Mathematical Economics, 48 (2012), 14-20.

[1] M. Kobayashi, M. Miyazawa and H. Shimizu: Structure-reversibility of a two dimensional reflecting random walk and its application to queueing network, Probability in the Engineering and Informational Sciences, 29(2015), 1-25.
[2] M. Kobayashi and M. Miyazawa : Tail asymptotics of the stationary distribution of a two dimensional reflecting random walk with unbounded upward jumps, Advances in Applied Probability, 46(2014), 365-399.
[3] M. Kobayashi, Y. Sakuma and M. Miyazawa: Join the shortest queue among k parallel queues: tail asymptotics of its stationary distribution, Queueing Systems, 74 (2013), 303-333.

[1] Suh-Ryung Kim, Jung Yeun Lee, Boram Park, Yoshio Sano: The competition hypergraphs of doubly partial orders, Discrete Applied Mathematics, 165(2014), 185-191.
[2] Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi: Fat Hoffman graphs with smallest eigenvalue greater than -1-τ, Ars Mathematica Contemporanea, 7(1), (2014), 247-262.
[3] Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi: Fat Hoffman graphs with smallest eigenvalue greater than -3, Discrete Applied Mathematics, 176(2014), 78-88.

1. “Fixed point optimization algorithms for distributed optimization in networked systems,” SIAM Journal on Optimization, 23 (2013), 1-26.
2. “Iterative algorithm for triple-hierarchical constrained nonconvex optimization problem and its application to network bandwidth allocation,” SIAM Journal on Optimization, 22 (2012), 862-878.
3. “Fixed point optimization algorithm and its application to power control in CDMA data networks,” Mathematical Programming, 133 (2012), 227-242.

1. “Bargaining outcomes in patent licensing: Asymptotic results in a general Cournot market,” Mathematical Social Sciences, 61 (2011) 114-123. （共著者 N. Watanabe and S. Muto）
2. “Fee versus royalty policy in licensing through bargaining: An application of the Nash bargaining solution,” Bulletin of Economic Research, 64 (2012) 293-304.（共著者 S. Muto）
3. “Stable bargaining outcomes in patent licensing: A cooperative game approach without side payments,” Mathematical Social Sciences, 66 (2013) 183-195.

1. “Software failure time data analysis via wavelet-based approach,” IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (A), E95-A (2012) 1490-1497．（共著者 T．Dohi）
2. “Wavelet shrinkage estimation for NHPP-based software reliability models,”IEEE Transactions on Reliability, 62 (2013) 211-225．（共著者 T．Dohi）
3. “Estimating software intensity function based on translation-invariant Poisson smoothing approach, ” IEEE Transactions on Reliability, 62 (2013) 930-945．（共著者 T．Dohi）

1. “Multi-period portfolio selection using kernel-based control policy with dimensionality reduction,” Expert Systems with Applications, 41 (2014), 3901-3914. （共著者 J. Gotoh）
2. “A sequential competitive bidding strategy considering inaccurate cost estimates,” Omega, 42 (2014), 132-140. （共著者N. Ishii and M. Muraki）
3. “A polynomial optimization approach to constant rebalanced portfolio selection,” Computational Optimization and Applications, 52 (2012), 645-666. （共著者 R. Sotirov）

1. “Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems,” Algorithmica, 62 (2012), 787-806.（共著者 K. Okumoto and H. Nagamochi）
2. “Iterative rounding approximation algorithms for degree-bounded node-connectivity network design”, Proceedings of 53rd Annual IEEE Symposium on Foundations of Computer Science, (2012) 263-272. （共著者 R. Ravi）
3. “Approximating minimum cost source location problems with local vertex-connectivity demand,” Journal of Discrete Algorithms, 19 (2013), 30-38.

1. “Robust shortest path problem based on a confidence interval in fuzzy bicriteria decision making,” Information Sciences, 221, pp. 520-533, 2013.
2. “Interactive decision making for uncertain minimum spanning tree problems with total importance based on a risk-management approach,” (共著者H. Katagiri), Applied Mathematical Modelling, 37, pp. 4548-4560, 2013.
3. “Risk-control approach for a bottleneck spanning tree problem with the total network reliability under uncertainty,” (共著者H. Katagiri and H. Tsuda), Journal of Applied Mathematics, Article ID 364086, doi:10.1155/2012/364086, 2012.

1. “Stationary distribution of a multi-server vacation queue with constant impatient times, ” (共著者A. Inoie), Operations Research Letters 40 (2012), 239-243.
2. “Asymptotic behavior for MArP/PH/2 queue with join the shortest queue discipline, ” Journal of the Operations Research Society of Japan 54 (2011), 46-64.
3. “Asymptotic behavior for MArP/PH/c queue with shortest queue discipline and jockeying, ” Operations Research Letters 38 (2010), 7-10.

1. “State-Dependent M/M/c/c+r Retrial Queues with Bernoulli Abandonment, ” (共著者H. Masuyama, S. Kasahara, and Y. Takahashi), Journal of Industrial and Management Optimization, Vol. 6, No. 3, 2010, pp. 517–540.
2. “A Matrix Continued Fraction Approach to Multiserver Retrial Queues, ” (共著者H. Masuyama, S. Kasahara, and Y. Takahashi), Annals of Operations Research, Vol. 202, No. 1, 2013, pp. 161-183.
3. “Single Server Retrial Queues with Two Way Communication, ” (共著者J. R. Artalejo), Applied Mathematical Modelling, Vol. 37, No. 4, 2013, pp. 1811–1822.

1. “Parallel solver for semidefinite programming problem having sparse Schur complement matrix, ” (共著者K. Fujisawa, M. Fukuda, K. Nakata, and M. Nakata), ACM Transactions on Mathematical Software, Vol. 39 (2012), Article No. 6.
2. “SFSDP: a Sparse Version of Full SemiDefinite Programming Relaxation for Sensor Network Localization Problems, ” (共著者S. Kim, M. Kojima, and H. Waki), ACM Transactions on Mathematical Software, Vol. 38 (2012), Article No. 27.
3. “Enclosing Ellipsoids and Elliptic Cylinders of Semialgebraic Sets and Their Application to Error Bounds in Polynomial Optimization, ” (共著者M. Kojima), Mathematical Programming, 138, 333-364 (2013).

1. On Shortest Disjoint Paths in Planar Graphs. Yusuke Kobayashi and Christian Sommer, Discrete Optimization, Vol.7 (2010), pp. 234-245.
2. An Improved Algorithm for the Half-disjoint PathsProblem. Ken-ichi Kawarabayashi and Yusuke Kobayashi, SIAM Journal on Discrete Mathematics, Vol.25 (2011), pp. 1322-1330.
3. Breaking O(n1/2)-approximation Algorithms for the Edge-disjoint Paths Problem with Congestion Two. Ken-ichi Kawarabayashi and and Yusuke Kobayashi, Proceedings of the 43rd ACM Symposium on Theory of Computing (STOC 2011), 2011, pp. 81-88.

1. The Geodesic Diameter of Polygonal Domains. Sang Won Bae, Matias Korman, and Yoshio Okamoto, Lecture Notes in Computer Science, 6346 (2010) 500-511.
2. A Polynomial-time-delay Polynomial-space Algorithm for Enumeration Problems in Multi-criteria Optimization. Yoshio Okamoto and Takeaki Uno, European Journal of Operational Research, Vol.210 (2011), pp.48-56
3. Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, and Takeaki Uno, Journal of Graph Algorithms and Applications, Vol.15 (2011), pp.727-751

1. A Bound for the Number of Different Basic Solutions Generated by the Simplex Method. Tomonari Kitahara and Shinji Mizuno, Mathematical Programming に掲載決定済み（Online 版は2011年8月3日に公開）
2. Klee-Minty’s LP and Upper Bounds for Dantzig’s Simplex Method. Tomonari Kitahara and Shinji Mizuno, Operations Research Letters, Vol.39 (2011), pp.88-91
3. Proximity of Weighted and Layered Least Squares Solutions. Tomonari Kitahara and Takashi Tsuchiya, SIAM Journal on Matrix Analysis and Applications, Vol.31 (2009), pp1172-1186.

1. An Approximation Algorithm for the Traveling Tournament Problem. Ryuhei Miyashiro, Tomomi Matsui,and Shinji Imahori, Annals of Operations Research, Vol.194, No.1 (2012), pp.317-324.
2. An Improved Approximation Algorithm for the Traveling Tournament Problem. Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashiro, and Tomomi Matsui, Algorithmica, Vol.61 (2011), pp.1077-1091.
3. An Approximation Algorithm for the Unconstrained Traveling Tournament Problem. Shinji Imahori, Tomomi Matsui, and Ryuhei , (PATAT 2010) (2010), pp.508-512.Miyashiro, Proc. 8th International Conference on the Practice and Theory of Automated Timetabling.

1. “SparsePOP: a Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems,” ACM Transactions on Mathematical Software, 15 (2008) (共著者 S. Kim, M. Kojima, M. Muramatsu, H. Sugimoto).
2. “Exploiting Sparsity in SDP Relaxation for Sensor Network Localization,” SIAM Journal on Optimization, 20 (2009) (共著者 S. Kim, M. Kojima).
3. “A Facial Reduction Algorithm for Finding Sparse SOS Representations,” Operations Research Letters, 38 (2010) (共著者 M. Muramatsu).

山元順雄氏は日本グローバルインフラストラクチャー研究財団に当初から理事として参画され，その後同財団の理事長として，インフラ問題をめぐる精力的な活動を国際的に展開され，今日に至っている．同財団は，当時三菱総合研究所の社長の中島正樹氏が，途上国発展のための大規模インフラストラクチャーへの投資の重要性を提唱したことを発端として1990年に設立されたものである．
山元氏は森口繁一先生が1982年に起ち上げた研究部会『第三世界とマイコン』に，森口先生から特に招かれ，参画された．その時から今日に至るまで，一貫してORに対する深い理解と期待を示されている．特に森口研究部会の後継研究部会である『巨大プロジェクトに関するOR』（主査：柳井浩先生）に始まり，今日に至るまでのインフラストラクチャーに関する研究部会に研究委託をされ続けてきた．会合場所の提供，今日的・国際的な研究課題の提案，データや種々の研究資料の提供，国内外の人脈の紹介，といった実に多面的な支援を常に真摯に続けられてきた．山元氏の物心両面の支援の下で，多くの若手研究者が育成されてきた．ここに感謝の意を表し「日本オペレーションズ・リサーチ学会特別賞」を授与することに決定した．