Akiyoshi Shioura

According to our database, Akiyoshi Shioura authored at least 50 papers between 1997 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Preemptive scheduling of parallel jobs of two sizes with controllable processing times.

Akiyoshi Shioura, Vitaly A. Strusevich, Natalia V. Shakhlevich

J. Sched., April, 2024

Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques.

Akiyoshi Shioura, Vitaly A. Strusevich, Natalia V. Shakhlevich

Networks, April, 2024

2022

M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System.

Akiyoshi Shioura

Math. Oper. Res., 2022

Polynomial-Time Approximation Schemes for a Class of Integrated Network Design and Scheduling Problems with Parallel Identical Machines.

Yusuke Saito, Akiyoshi Shioura

Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022

2020

Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost.

Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich

J. Glob. Optim., 2020

A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption.

Yusei Fujimori, Yasushi Kawase, Tomomi Matsui, Akiyoshi Shioura

Inf. Process. Lett., 2020

2018

Models and algorithms for energy-efficient scheduling with immediate start of jobs.

Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich, Bernhard Primas

J. Sched., 2018

Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches.

Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich

Eur. J. Oper. Res., 2018

Colored spanning graphs for set visualization.

Ferran Hurtado, Matias Korman, Marc J. van Kreveld, Maarten Löffler, Vera Sacristán, Akiyoshi Shioura, Rodrigo I. Silveira, Bettina Speckmann, Takeshi Tokuyama

Comput. Geom., 2018

2017

Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints.

Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich

INFORMS J. Comput., 2017

2016

Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines.

Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich

INFORMS J. Comput., 2016

Time bounds for iterative auctions: A unified approach by discrete convex analysis.

Kazuo Murota, Akiyoshi Shioura, Zaifu Yang

Discret. Optim., 2016

Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimization.

Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich

Proceedings of the Discrete Optimization and Operations Research, 2016

2015

Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times.

Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich

Math. Program., 2015

Foreword.

Akiyoshi Shioura

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

Buyback Problem with Discrete Concave Valuation Functions.

Shun Fukuda, Akiyoshi Shioura, Takeshi Tokuyama

Proceedings of the Approximation and Online Algorithms - 13th International Workshop, 2015

2014

Exact bounds for steepest descent algorithms of L-convex function minimization.

Kazuo Murota, Akiyoshi Shioura

Oper. Res. Lett., 2014

Dijkstra's algorithm and L-concave function maximization.

Kazuo Murota, Akiyoshi Shioura

Math. Program., 2014

2013

A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines.

Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich

SIAM J. Discret. Math., 2013

Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items.

Kazuo Murota, Akiyoshi Shioura, Zaifu Yang

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012

A Unified View to Greedy Geometric Routing Algorithms in Ad Hoc Networks.

Jinhee Chun, Akiyoshi Shioura, Truong Minh Tien, Takeshi Tokuyama

Proceedings of the Algorithms for Sensor Systems, 2012

2011

M-Convex Function Minimization by Continuous Relaxation Approach: Proximity Theorem and Algorithm.

Satoko Moriguchi, Akiyoshi Shioura, Nobuyuki Tsuchimura

SIAM J. Optim., 2011

Optimal Allocation in Combinatorial Auctions with Quadratic Utility Functions.

Akiyoshi Shioura, Shunya Suzuki

Proceedings of the Theory and Applications of Models of Computation, 2011

Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility under Budget Constraints.

Akiyoshi Shioura

Proceedings of the Algorithms - ESA 2011, 2011

2010

Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra.

Akiyoshi Shioura

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009

Single Machine Scheduling with Controllable Processing Times by submodular Optimization.

Natalia V. Shakhlevich, Akiyoshi Shioura, Vitaly A. Strusevich

Int. J. Found. Comput. Sci., 2009

On the Pipage Rounding Algorithm for Submodular Function Maximization - a View from Discrete Convex Analysis.

Akiyoshi Shioura

Discret. Math. Algorithms Appl., 2009

New algorithms for convex cost tension problem with application to computer vision.

Vladimir Kolmogorov, Akiyoshi Shioura

Discret. Optim., 2009

A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions.

Akiyoshi Shioura, Mutsunori Yagiura

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008

Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach.

Natalia V. Shakhlevich, Akiyoshi Shioura, Vitaly A. Strusevich

Proceedings of the Algorithms, 2008

2007

Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems.

Akiyoshi Shioura, Ken'ichiro Tanaka

SIAM J. Discret. Math., 2007

2005

Substitutes and complements in network flows viewed as discrete convexity.

Kazuo Murota, Akiyoshi Shioura

Discret. Optim., 2005

Efficiently Pricing European-Asian Options - Ultimate Implementation and Analysis of the AMO Algorithm.

Akiyoshi Shioura, Takeshi Tokuyama

Proceedings of the Algorithmic Applications in Management, First International Conference, 2005

2004

The MA-ordering max-flow algorithm is not strongly polynomial for directed networks.

Akiyoshi Shioura

Oper. Res. Lett., 2004

Conjugacy relationship between M-convex and L-convex functions in continuous variables.

Kazuo Murota, Akiyoshi Shioura

Math. Program., 2004

On Hochbaum's Proximity-Scaling Algorithm for the General Resource Allocation Problem.

Satoko Moriguchi, Akiyoshi Shioura

Math. Oper. Res., 2004

Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem.

Akiyoshi Shioura

Discret. Appl. Math., 2004

Quadratic M-convex and L-convex functions.

Kazuo Murota, Akiyoshi Shioura

Adv. Appl. Math., 2004

2003

Quasi M-convex and L-convex functions--quasiconvexity in discrete optimization.

Kazuo Murota, Akiyoshi Shioura

Discret. Appl. Math., 2003

2002

Scaling Algorithms for M-Convex Function Minimization.

Satoko Moriguchi, Kazuo Murota, Akiyoshi Shioura

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002

A Fast, Accurate and Simple Method for Pricing European-Asian and Saving-Asian Options.

Kenichiro Ohta, Kunihiko Sadakane, Akiyoshi Shioura, Takeshi Tokuyama

Proceedings of the Algorithms, 2002

2001

Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella.

Kazuo Murota, Akiyoshi Shioura

Discret. Appl. Math., 2001

2000

Extension of M-Convexity and L-Convexity to Polyhedral Convex Functions.

Kazuo Murota, Akiyoshi Shioura

Adv. Appl. Math., 2000

Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks.

S. Thomas McCormick, Akiyoshi Shioura

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

M-Convex Function on Generalized Polymatroid.

Kazuo Murota, Akiyoshi Shioura

Math. Oper. Res., 1999

1998

Minimization of an M-convex Function.

Akiyoshi Shioura

Discret. Appl. Math., 1998

A Constructive Proof for the Induction of M-convex Functions through Networks.

Akiyoshi Shioura

Discret. Appl. Math., 1998

1997

An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs.

Akiyoshi Shioura, Akihisa Tamura, Takeaki Uno

SIAM J. Comput., 1997

The tree center problems and the relationship with the bottleneck knapsack problems.

Akiyoshi Shioura, Maiko Shigeno

Networks, 1997

A Linear Time Algorithm for Finding a k-Tree Core.

Akiyoshi Shioura, Takeaki Uno

J. Algorithms, 1997