Akiyoshi SHIOURA
Titolo
Citata da
Citata da
Anno
M-convex function on generalized polymatroid
K Murota, A Shioura
Mathematics of operations research 24 (1), 95-105, 1999
1761999
An optimal algorithm for scanning all spanning trees of undirected graphs
A Shioura, A Tamura, T Uno
SIAM Journal on Computing 26 (3), 678-692, 1997
1351997
Resource allocation problems
N Katoh, T Ibaraki
Handbook of combinatorial optimization, 905-1006, 1998
1111998
Extension of M-convexity and L-convexity to polyhedral convex functions
K Murota, A Shioura
Advances in Applied Mathematics 25 (4), 352-427, 2000
612000
Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati–Tardella
K Murota, A Shioura
Discrete Applied Mathematics 115 (1-3), 151-176, 2001
572001
New algorithms for convex cost tension problem with application to computer vision
V Kolmogorov, A Shioura
Discrete Optimization 6 (4), 378-393, 2009
522009
Efficiently scanning all spanning trees of an undirected graph
A Shioura, A Tamura
Journal of the Operations Research Society of Japan 38 (3), 331-344, 1995
511995
Minimization of an M-convex function
A Shioura
Discrete Applied Mathematics 84 (1-3), 215-220, 1998
461998
Gross substitutes condition and discrete concavity for multi-unit valuations: a survey
A Shioura, A Tamura
Journal of the Operations Research Society of Japan 58 (1), 61-103, 2015
452015
Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem
A Shioura
Discrete Applied Mathematics 134 (1-3), 303-316, 2004
392004
Dijkstra’s algorithm and L-concave function maximization
K Murota, A Shioura
Mathematical Programming 145 (1), 163-177, 2014
382014
Quasi M-convex and L-convex functions—quasiconvexity in discrete optimization
K Murota, A Shioura
Discrete Applied Mathematics 131 (2), 467-494, 2003
332003
Scaling algorithms for M-convex function minimization
S Moriguchi, K Murota, A Shioura
IEICE Transactions on Fundamentals of Electronics, Communications and…, 2002
272002
Conjugacy relationship between M-convex and L-convex functions in continuous variables
K Murota, A Shioura
Mathematical programming 101 (3), 415-433, 2004
262004
A linear time algorithm for finding ak-tree core
A Shioura, T Uno
Journal of Algorithms 23 (2), 281-290, 1997
261997
Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines
A Shioura, NV Shakhlevich, VA Strusevich
INFORMS Journal on Computing 28 (1), 148-161, 2016
242016
Exact bounds for steepest descent algorithms of L-convex function minimization
K Murota, A Shioura
Operations Research Letters 42 (5), 361-366, 2014
242014
Single machine scheduling with controllable processing times by submodular optimization
NV Shakhlevich, A Shioura, VA Strusevich
International Journal of Foundations of Computer Science 20 (02), 247-269, 2009
242009
M-convex function minimization by continuous relaxation approach: Proximity theorem and algorithm
S Moriguchi, A Shioura, N Tsuchimura
SIAM Journal on Optimization 21 (3), 633-668, 2011
232011
Fundamental properties of M-convex and L-convex functions in continuous variables
K Murota, A Shioura
IEICE Transactions on Fundamentals of Electronics, Communications and…, 2004
232004
Il sistema al momento non pu eseguire l'operazione. Riprova pi tardi.
Articoli 1–20