Akiyoshi Shioura

59 papers A* 1A 3B 2C 4Misc 1Journal 46Unranked 2

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