社団法人 日本オペレーションズ・リサーチ学会
ENGLISH
入会申込み お問合わせ
HOME オペレーションズ・リサーチ学会とは 研究活動案内 OR事典Wiki 機関誌 論文誌 会員の方へ
活動概要
会長挨拶
支部紹介
 
HOME  > オペレーションズ・リサーチ学会とは  > 表彰 > 研究賞奨励賞
表彰
研究賞奨励賞 Research Encourage Award
第5回 (2015年度) 受賞者及び 研究内容

機関誌

福田エレン秀美
(京都大学)

① E. H. Fukuda and L. M. Grana Drummond: Inexact projected gradient method for vector optimization, Computational Optimization and Applications, 54(2013) , 473-493.
② 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.
③ 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.

奥野貴之
(東京理科大学)) 

① 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.
② 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.
③ 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.

坂東桂介
(東京工業大学)

① 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.
② 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.
③ K. Bando: Many-to-one matching markets with externalities among firms, Journal of Mathematical Economics, 48 (2012), 14-20.

小林正弘
(東海大学)

① 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.
② 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.
③ 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.


佐野良夫
(筑波大学)

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

ページトップへ戻る
研究賞奨励賞 Research Encourage Award
第4回 (2014年度) 受賞者及び 研究内容

機関誌

飯塚秀明
(明治大学)

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.

ページトップへ戻る
第3回 (2013年度) 受賞者及び 研究内容

機関誌

蓮池 隆
(大阪大学)

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, ” Operations Research Letters 40 (2012), 239-243.(共著者A. Inoie)
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.

フン・ドック・トゥアン
Phung-Duc Tuan)
(東京工業大学)

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)

ページトップへ戻る
第2回 (2012年度) 受賞者及び 研究内容

機関誌

小林佑輔
(東京大学)

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 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 Miyashiro
Proc. 8th International Conference on the Practice and Theory of Automated Timetabling
(PATAT 2010) (2010), pp.508-512.

ページトップへ戻る
第1回 (2011年度) 受賞者及び 研究内容

脇 隼人
(電気通信大学)

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).

ページトップへ戻る
文献賞奨励賞 Best Paper of the Year among Young Researchers
年度 受賞者 研究内容
5 2010 梅谷俊治
(大阪大学)

Solving the irregular strip packing problem via guided local
search for overlap minimization
(International Transactions in Operational Research,
Vol.16, No.6)

恐神貴行
(日本アイ・ビー・エム㈱)

Finding probably best systems quickly via simulations
(ACM Transactions on Modeling and Computer
Simulation, Vol.19, No.3)

来嶋秀治
(京都大学)

Approximation algorithm and perfect sampler for closed
Jackson networks with single servers
(SIAM Journal on Computing, Vol.38, No.4)

高澤兼二郎
(東京大学)

A weighted even factor algorithm
(Mathematical Programming, 115)
A weighted kt,t-free t-factor algorithm for bipartite graphs
(Mathematics of Operations Research, Vol.34, No.2)

林 俊介
(京都大学)

Spectrum management for interference-limited multiuser
communication systems
(IEEE Transactions on Information Theory, Vol.55, No.3)

4 2009 垣村尚徳
(東京大学)

Solving Linear Programs from Sign Patterns
(Mathematical Programming, Vol.114, No.2)
Sign-Solvable Linear ・Complementarity Problems
(Linear Algebra and its Applications, Vol.429, Nos. 1-2)

加藤憲一
(東京工業大学)

Upper bound for the decay rate of the joint queue-length distribution in a two-node Markovian queueing system
(Queueing Systems, Vol.58, No.3)

平井広志
(京都大学)

Electric Network Classifiers for Semi-Supervised Learning on Graphs
(Journal of the Operations Research Society of Japan, Vol.50, No.3)

3 2008 成島康史
(東京理科大学)

A Nonmonotone Memory Gradient Method for Unconstrained Optimization
(Journal of the Operations Research Society of Japan Vol.50, No.1)

福田光浩
(東京工業大学)

Large-scale semidefinite programs in electronic structure calculation
(Mathematical Programming Series B, 109)

2 2007 石井利昌
(小樽商科大学)

Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
(Discrete Applied Mathematics 154)

後藤順哉
(筑波大学)

Minimal Ellipsoid Circumscribing a Polytope Defined by a System of Linea Inequalities
(Journal of Global Optimization 34)
A linear classification model based on conditional geometric score
(Pacific Journal of Optimization Vol.1, No.2)

増山博之
(京都大学)

Algorithmic Computation of the Time-Dependent Solution of Structured Markov Chains and Its Application to Queues
(Stochastic Models Vol.21)

1 2006 河西憲一
(群馬大学)

On the Counting Process for a Class of Markovian Arrival Processes with an Application to a Queueing System
(Queueing Systems 49)

塩浦昭義
(東北大学)

Fast Scaling Algorithms for M-convex Function Minimization with Application to the Resource Allocation Problem
(Discrete Applied Mathematics 134)

藤澤克樹
(東京電機大学)

Solving Large Scale Optimization Problems via Grid and Cluster Computing
(Journal of the Operations Research Society of Japan Vol.47, No.4)

山下信雄
(京都大学)

On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm
(Mathematical Programming Vol.99, No.2)

ページトップへ戻る
HOMEに戻る
イベントカレンダー
第2回ORセミナー
日程:
2016年10月15日
場所:
(株)構造計画研究所

第3回ORセミナー
日程:
2016年11月12日
場所:
(株)構造計画研究所

ICCOPT
日程:
2016年8月6日~7日
場所:
国立オリンピック記念青少年総合センター
日程:
2016年8月8日~11日
場所:
政策研究大学院大学
シンポジウム
2016年秋季シンポジウム
日程:
2016年9月14日(水)
場所:
山形大学
研究発表会
2016年秋季研究発表会
日程:
2016年9月15日(木),16日(金)
場所:
山形大学