Akiyoshi Shioura - Publications

School of Engineering Tokyo Institute of Technology, Yokohama-shi, Kanagawa-ken, Japan 

50 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Fujimori Y, Kawase Y, Matsui T, Shioura A. A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption Information Processing Letters. 162: 105991. DOI: 10.1016/J.Ipl.2020.105991  0.522
2020 Shioura A, Shakhlevich NV, Strusevich VA. Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost Journal of Global Optimization. 76: 471-490. DOI: 10.1007/S10898-018-0686-2  0.434
2019 Minamikawa N, Shioura A. Separable Convex Resource Allocation Problem With L1-Distance Constraint Journal of the Operations Research Society of Japan. 62: 109-120. DOI: 10.15807/Jorsj.62.109  0.392
2018 Murota K, Shioura A. On Equivalence Of M♮-Concavity Of A Set Function And Submodularity Of Its Conjugate Journal of the Operations Research Society of Japan. 61: 163-171. DOI: 10.15807/Jorsj.61.163  0.356
2018 Shioura A, Shakhlevich NV, Strusevich VA. Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches European Journal of Operational Research. 266: 795-818. DOI: 10.1016/J.Ejor.2017.08.034  0.497
2018 Hurtado F, Korman M, Kreveld MJv, Löffler M, Sacristán V, Shioura A, Silveira RI, Speckmann B, Tokuyama T. Colored spanning graphs for set visualization Computational Geometry: Theory and Applications. 68: 262-276. DOI: 10.1016/J.Comgeo.2017.06.006  0.646
2018 Murota K, Shioura A. Simpler exchange axioms for M-concave functions on generalized polymatroids Japan Journal of Industrial and Applied Mathematics. 35: 235-259. DOI: 10.1007/S13160-017-0285-5  0.386
2018 Shioura A, Shakhlevich NV, Strusevich VA, Primas B. Models and algorithms for energy-efficient scheduling with immediate start of jobs Journal of Scheduling. 21: 505-516. DOI: 10.1007/S10951-017-0552-Y  0.381
2017 Shioura A. Algorithms For L-Convex Function Minimization: Connection Between Discrete Convex Analysis And Other Research Fields Journal of the Operations Research Society of Japan. 60: 216-243. DOI: 10.15807/Jorsj.60.216  0.473
2017 Shioura A, Shakhlevich NV, Strusevich VA. Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints Informs Journal On Computing. 29: 724-736. DOI: 10.1287/Ijoc.2017.0758  0.408
2017 Fukuda S, Shioura A, Tokuyama T. Buyback problem with discrete concave valuation functions Discrete Optimization. 26: 78-96. DOI: 10.1016/J.Disopt.2017.07.002  0.677
2017 Murota K, Shioura A. Note on time bounds of two-phase algorithms for L-convex function minimization Japan Journal of Industrial and Applied Mathematics. 34: 429-440. DOI: 10.1007/S13160-017-0246-Z  0.53
2016 Shioura A, Shakhlevich NV, Strusevich VA. Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines Informs Journal On Computing. 28: 148-161. DOI: 10.1287/Ijoc.2015.0660  0.451
2016 Murota K, Shioura A, Yang Z. Time bounds for iterative auctions Discrete Optimization. 19: 36-62. DOI: 10.1016/J.Disopt.2016.01.001  0.49
2015 Shioura A, Tamura A. Gross Substitutes Condition And Discrete Concavity For Multi-Unit Valuations: A Survey Journal of the Operations Research Society of Japan. 58: 61-103. DOI: 10.15807/Jorsj.58.61  0.348
2015 Fujishige S, Murota K, Shioura A. Monotonicity In Steepest Ascent Algorithms For Polyhedral L-Concave Functions Journal of the Operations Research Society of Japan. 58: 184-208. DOI: 10.15807/Jorsj.58.184  0.526
2015 Shioura A. Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints Mathematics of Operations Research. 40: 192-225. DOI: 10.1287/Moor.2014.0668  0.521
2015 Ikebe YT, Sekiguchi Y, Shioura A, Tamura A. Stability and competitive equilibria in multi-unit trading networks with discrete concave utility functions Japan Journal of Industrial and Applied Mathematics. 32: 373-410. DOI: 10.1007/S13160-015-0175-7  0.343
2015 Shioura A, Shakhlevich NV, Strusevich VA. Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times Mathematical Programming. 153: 495-534. DOI: 10.1007/S10107-014-0814-9  0.485
2014 Murota K, Shioura A. Exact bounds for steepest descent algorithms of L-convex function minimization Operations Research Letters. 42: 361-366. DOI: 10.1016/J.Orl.2014.06.005  0.549
2014 Murota K, Shioura A. Dijkstra's algorithm and L-concave function maximization Mathematical Programming. 145: 163-177. DOI: 10.1007/S10107-013-0643-2  0.564
2013 Shioura A, Shakhlevich NV, Strusevich VA. A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines Siam Journal On Discrete Mathematics. 27: 186-204. DOI: 10.1137/110843836  0.519
2012 Shioura A, Suzuki S. Optimal Allocation Problem With Quadratic Utility Functions And Its Relationship With Graph Cut Problem Journal of the Operations Research Society of Japan. 55: 92-105. DOI: 10.15807/Jorsj.55.92  0.529
2012 Shioura A. Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra Siam Journal On Discrete Mathematics. 26: 114-144. DOI: 10.1137/110831684  0.368
2012 Shioura A. Matroid rank functions and discrete concavity Japan Journal of Industrial and Applied Mathematics. 29: 535-546. DOI: 10.1007/S13160-012-0082-0  0.358
2011 Moriguchi S, Shioura A, Tsuchimura N. M-Convex Function Minimization By Continuous Relaxation Approach: Proximity Theorem And Algorithm Siam Journal On Optimization. 21: 633-668. DOI: 10.1137/080736156  0.578
2010 Shioura A, Yagiura M. A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions Journal of Graph Algorithms and Applications. 14: 391-407. DOI: 10.7155/Jgaa.00213  0.424
2009 Shioura A. On The Pipage Rounding Algorithm For Submodular Function Maximization — A View From Discrete Convex Analysis Discrete Mathematics, Algorithms and Applications. 1: 1-23. DOI: 10.1142/S1793830909000063  0.533
2009 Shakhlevich NV, Shioura A, Strusevich VA. Single Machine Scheduling With Controllable Processing Times By Submodular Optimization International Journal of Foundations of Computer Science. 20: 247-269. DOI: 10.1142/S0129054109006541  0.505
2009 Kolmogorov V, Shioura A. New algorithms for convex cost tension problem with application to computer vision Discrete Optimization. 6: 378-393. DOI: 10.1016/J.Disopt.2009.04.006  0.56
2008 Murota K, Shioura A. Note On The Continuity Of M-Convex And L-Convex Functions In Continuous Variables Journal of the Operations Research Society of Japan. 51: 265-273. DOI: 10.15807/Jorsj.51.265  0.396
2007 Shioura A, Tanaka K. Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems Siam Journal On Discrete Mathematics. 21: 504-522. DOI: 10.1137/060656899  0.596
2006 Shioura A, Sun N, Yang Z. Efficient Strategy Proof Fair Allocation Algorithms Journal of the Operations Research Society of Japan. 49: 144-150. DOI: 10.15807/Jorsj.49.144  0.406
2006 Shioura A, Tokuyama T. Efficiently pricing European-Asian options: ultimate implementation and analysis of the AMO algorithm Information Processing Letters. 100: 213-219. DOI: 10.1016/J.Ipl.2006.07.006  0.639
2005 Murota K, Shioura A. Substitutes and complements in network flows viewed as discrete convexity Discrete Optimization. 2: 256-268. DOI: 10.1016/J.Disopt.2005.04.002  0.42
2004 Moriguchi S, Shioura A. On Hochbaum's Proximity-Scaling Algorithm for the General Resource Allocation Problem Mathematics of Operations Research. 29: 394-397. DOI: 10.1287/Moor.1030.0076  0.51
2004 Shioura A. The MA-ordering max-flow algorithm is not strongly polynomial for directed networks Operations Research Letters. 32: 31-35. DOI: 10.1016/S0167-6377(03)00070-1  0.487
2004 Shioura A. Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem Discrete Applied Mathematics. 134: 303-316. DOI: 10.1016/S0166-218X(03)00255-5  0.566
2004 Murota K, Shioura A. Quadratic M-convex and L-convex functions Advances in Applied Mathematics. 33: 318-341. DOI: 10.1016/J.Aam.2003.11.001  0.447
2004 Murota K, Shioura A. Conjugacy relationship between M-convex and L-convex functions in continuous variables Mathematical Programming. 101: 415-433. DOI: 10.1007/S10107-003-0478-3  0.464
2003 Murota K, Shioura A. Quasi M-convex and L-convex functions: quasiconvexity in discrete optimization Discrete Applied Mathematics. 131: 467-494. DOI: 10.1016/S0166-218X(02)00468-7  0.444
2001 Murota K, Shioura A. Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella Discrete Applied Mathematics. 115: 151-176. DOI: 10.1016/S0166-218X(01)00222-0  0.437
2000 Mccormick ST, Shioura A. Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks Operations Research Letters. 27: 199-207. DOI: 10.1016/S0167-6377(00)00059-6  0.511
2000 Murota K, Shioura A. Extension of M-Convexity and L-Convexity to Polyhedral Convex Functions Advances in Applied Mathematics. 25: 352-427. DOI: 10.1006/Aama.2000.0702  0.447
1999 Murota K, Shioura A. M-Convex Function on Generalized Polymatroid Mathematics of Operations Research. 24: 95-105. DOI: 10.1287/Moor.24.1.95  0.45
1998 Shioura A. Minimization of an M-convex function Discrete Applied Mathematics. 84: 215-220. DOI: 10.1016/S0166-218X(97)00140-6  0.501
1998 Shioura A. A constructive proof for the induction of M-convex functions through networks Discrete Applied Mathematics. 82: 271-278. DOI: 10.1016/S0166-218X(97)00089-9  0.414
1997 Shioura A, Tamura A, Uno T. An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs Siam Journal On Computing. 26: 678-692. DOI: 10.1137/S0097539794270881  0.455
1997 Shioura A, Uno T. A Linear Time Algorithm for Finding ak-Tree Core Journal of Algorithms. 23: 281-290. DOI: 10.1006/Jagm.1996.0838  0.458
1997 Shioura A, Shigeno M. The tree center problems and the relationship with the bottleneck knapsack problems Networks. 29: 107-110. DOI: 10.1002/(Sici)1097-0037(199703)29:2<107::Aid-Net4>3.0.Co;2-N  0.454
Show low-probability matches.