| 年 |
回数 |
受賞者 |
テーマ |
| 2011 |
1 |
脇 隼人
(電気通信大学) |
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). |
|
| 年 |
回数 |
受賞者 |
テーマ |
| 2010 |
5 |
梅谷俊治
（大阪大学） |
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）
|
| 2009 |
4 |
垣村尚徳
（東京大学） |
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） |
| 2008 |
3 |
成島康史
(東京理科大学) |
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） |
| 2007 |
2 |
石井利昌
(小樽商科大学) |
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） |
| 2006 |
1 |
河西憲一
(群馬大学) |
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） |
