Akiyoshi Shioura

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 15

Top Topics

Identical Machines

Approximation Schemes

Scheduling Problem

Processing Times

Top Venues

Math. Oper. Res.

INFORMS J. Comput.

Discret. Optim.

Publications

Akiyoshi Shioura, Vitaly A. Strusevich, Natalia V. Shakhlevich
Preemptive scheduling of parallel jobs of two sizes with controllable processing times. J. Sched. 27 (2) (2024)
Akiyoshi Shioura, Vitaly A. Strusevich, Natalia V. Shakhlevich
Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques. Networks 83 (3) (2024)
Akiyoshi Shioura
M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System. Math. Oper. Res. 47 (2) (2022)
Yusuke Saito, Akiyoshi Shioura
Polynomial-Time Approximation Schemes for a Class of Integrated Network Design and Scheduling Problems with Parallel Identical Machines. ISCO (2022)
Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich
Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost. J. Glob. Optim. 76 (3) (2020)
Yusei Fujimori, Yasushi Kawase, Tomomi Matsui, Akiyoshi Shioura
A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption. Inf. Process. Lett. 162 (2020)
Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich
Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches. Eur. J. Oper. Res. 266 (3) (2018)
Ferran Hurtado, Matias Korman, Marc J. van Kreveld, Maarten Löffler, Vera Sacristán, Akiyoshi Shioura, Rodrigo I. Silveira, Bettina Speckmann, Takeshi Tokuyama
Colored spanning graphs for set visualization. Comput. Geom. 68 (2018)
Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich, Bernhard Primas
Models and algorithms for energy-efficient scheduling with immediate start of jobs. J. Sched. 21 (5) (2018)
Shun Fukuda, Akiyoshi Shioura, Takeshi Tokuyama
Buyback problem with discrete concave valuation functions. Discret. Optim. 26 (2017)
Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich
Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints. INFORMS J. Comput. 29 (4) (2017)
Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich
Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimization. DOOR (2016)
Ferran Hurtado, Matias Korman, Marc J. van Kreveld, Maarten Löffler, Vera Sacristán, Akiyoshi Shioura, Rodrigo I. Silveira, Bettina Speckmann, Takeshi Tokuyama
Colored Spanning Graphs for Set Visualization. CoRR (2016)
Kazuo Murota, Akiyoshi Shioura, Zaifu Yang
Time bounds for iterative auctions: A unified approach by discrete convex analysis. Discret. Optim. 19 (2016)
Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich
Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines. INFORMS J. Comput. 28 (1) (2016)
Akiyoshi Shioura
Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints. Math. Oper. Res. 40 (1) (2015)
Akiyoshi Shioura
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (6) (2015)
Shun Fukuda, Akiyoshi Shioura, Takeshi Tokuyama
Buyback Problem with Discrete Concave Valuation Functions. WAOA (2015)
Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich
Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times. Math. Program. 153 (2) (2015)
Jinhee Chun, Akiyoshi Shioura, Truong Minh Tien, Takeshi Tokuyama
A Unified View to Greedy Geometric Routing Algorithms in Ad Hoc Networks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (6) (2014)
Kazuo Murota, Akiyoshi Shioura
Dijkstra's algorithm and L-concave function maximization. Math. Program. 145 (1-2) (2014)
Kazuo Murota, Akiyoshi Shioura
Exact bounds for steepest descent algorithms of L-convex function minimization. Oper. Res. Lett. 42 (5) (2014)
Kazuo Murota, Akiyoshi Shioura, Zaifu Yang
Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items. ISAAC (2013)
Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich
A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines. SIAM J. Discret. Math. 27 (1) (2013)
Jinhee Chun, Akiyoshi Shioura, Truong Minh Tien, Takeshi Tokuyama
A Unified View to Greedy Geometric Routing Algorithms in Ad Hoc Networks. ALGOSENSORS (2012)
Akiyoshi Shioura
Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra. SIAM J. Discret. Math. 26 (1) (2012)
Satoko Moriguchi, Akiyoshi Shioura, Nobuyuki Tsuchimura
M-Convex Function Minimization by Continuous Relaxation Approach: Proximity Theorem and Algorithm. SIAM J. Optim. 21 (3) (2011)
Akiyoshi Shioura
Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility under Budget Constraints. ESA (2011)
Akiyoshi Shioura, Shunya Suzuki
Optimal Allocation in Combinatorial Auctions with Quadratic Utility Functions. TAMC (2011)
Akiyoshi Shioura
Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra. ISAAC (1) (2010)
Akiyoshi Shioura, Mutsunori Yagiura
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions. J. Graph Algorithms Appl. 14 (2) (2010)
Akiyoshi Shioura
On the Pipage Rounding Algorithm for Submodular Function Maximization - a View from Discrete Convex Analysis. Discret. Math. Algorithms Appl. 1 (1) (2009)
Vladimir Kolmogorov, Akiyoshi Shioura
New algorithms for convex cost tension problem with application to computer vision. Discret. Optim. 6 (4) (2009)
Natalia V. Shakhlevich, Akiyoshi Shioura, Vitaly A. Strusevich
Single Machine Scheduling with Controllable Processing Times by submodular Optimization. Int. J. Found. Comput. Sci. 20 (2) (2009)
Akiyoshi Shioura, Mutsunori Yagiura
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions. COCOON (2009)
Natalia V. Shakhlevich, Akiyoshi Shioura, Vitaly A. Strusevich
Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach. ESA (2008)
Akiyoshi Shioura, Ken'ichiro Tanaka
Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems. SIAM J. Discret. Math. 21 (2) (2007)
Akiyoshi Shioura, Takeshi Tokuyama
Efficiently pricing European-Asian options - ultimate implementation and analysis of the AMO algorithm. Inf. Process. Lett. 100 (6) (2006)
Kazuo Murota, Akiyoshi Shioura
Substitutes and complements in network flows viewed as discrete convexity. Discret. Optim. 2 (3) (2005)
Kenichiro Ohta, Kunihiko Sadakane, Akiyoshi Shioura, Takeshi Tokuyama
A Fast, Accurate, and Simple Method for Pricing European-Asian and Saving-Asian Options. Algorithmica 42 (2) (2005)
Akiyoshi Shioura, Takeshi Tokuyama
Efficiently Pricing European-Asian Options - Ultimate Implementation and Analysis of the AMO Algorithm. AAIM (2005)
Kazuo Murota, Akiyoshi Shioura
Quadratic M-convex and L-convex functions. Adv. Appl. Math. 33 (2) (2004)
Akiyoshi Shioura
Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. Discret. Appl. Math. 134 (1-3) (2004)
Akiyoshi Shioura
The MA-ordering max-flow algorithm is not strongly polynomial for directed networks. Oper. Res. Lett. 32 (1) (2004)
Kazuo Murota, Akiyoshi Shioura
Conjugacy relationship between M-convex and L-convex functions in continuous variables. Math. Program. 101 (3) (2004)
Satoko Moriguchi, Akiyoshi Shioura
On Hochbaum's Proximity-Scaling Algorithm for the General Resource Allocation Problem. Math. Oper. Res. 29 (2) (2004)
Kazuo Murota, Akiyoshi Shioura
Quasi M-convex and L-convex functions--quasiconvexity in discrete optimization. Discret. Appl. Math. 131 (2) (2003)
Satoko Moriguchi, Kazuo Murota, Akiyoshi Shioura
Scaling Algorithms for M-Convex Function Minimization. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (5) (2002)
Kenichiro Ohta, Kunihiko Sadakane, Akiyoshi Shioura, Takeshi Tokuyama
A Fast, Accurate and Simple Method for Pricing European-Asian and Saving-Asian Options. ESA (2002)
Kazuo Murota, Akiyoshi Shioura
Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella. Discret. Appl. Math. 115 (1-3) (2001)
S. Thomas McCormick, Akiyoshi Shioura
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks. SODA (2000)
S. Thomas McCormick, Akiyoshi Shioura
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks. Oper. Res. Lett. 27 (5) (2000)
Kazuo Murota, Akiyoshi Shioura
Extension of M-Convexity and L-Convexity to Polyhedral Convex Functions. Adv. Appl. Math. 25 (4) (2000)
Kazuo Murota, Akiyoshi Shioura
M-Convex Function on Generalized Polymatroid. Math. Oper. Res. 24 (1) (1999)
Akiyoshi Shioura
Minimization of an M-convex Function. Discret. Appl. Math. 84 (1-3) (1998)
Akiyoshi Shioura
A Constructive Proof for the Induction of M-convex Functions through Networks. Discret. Appl. Math. 82 (1-3) (1998)
Akiyoshi Shioura, Takeaki Uno
A Linear Time Algorithm for Finding a k-Tree Core. J. Algorithms 23 (2) (1997)
Akiyoshi Shioura, Maiko Shigeno
The tree center problems and the relationship with the bottleneck knapsack problems. Networks 29 (2) (1997)
Akiyoshi Shioura, Akihisa Tamura, Takeaki Uno
An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs. SIAM J. Comput. 26 (3) (1997)