The following pages link to Akiyoshi Shioura (Q170013):
Displaying 50 items.
- Stability and competitive equilibria in multi-unit trading networks with discrete concave utility functions (Q495853) (← links)
- Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times (Q747774) (← links)
- Efficiently pricing European-Asian options-ultimate implementation and analysis of the AMO algorithm (Q845869) (← links)
- New algorithms for convex cost tension problem with application to computer vision (Q1040084) (← links)
- (Q1383386) (redirect page) (← links)
- A constructive proof for the induction of M-convex functions through networks (Q1383387) (← links)
- Minimization of an M-convex function (Q1392577) (← links)
- Quasi M-convex and L-convex functions -- quasiconvexity in discrete optimization (Q1410696) (← links)
- Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. (Q1421475) (← links)
- The MA-ordering max-flow algorithm is not strongly polynomial for directed networks (Q1433655) (← links)
- Colored spanning graphs for set visualization (Q1699297) (← links)
- Simpler exchange axioms for M-concave functions on generalized polymatroids (Q1742881) (← links)
- Time bounds for iterative auctions: a unified approach by discrete convex analysis (Q1751147) (← links)
- Buyback problem with discrete concave valuation functions (Q1751249) (← links)
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
- Conjugacy relationship between M-convex and L-convex functions in continuous variables (Q1764239) (← links)
- Exact bounds for steepest descent algorithms of $L$-convex function minimization (Q1785253) (← links)
- Extension of M-convexity and L-convexity to polyhedral convex functions (Q1841175) (← links)
- Quadratic M-convex and L-convex functions (Q1883382) (← links)
- Matroid rank functions and discrete concavity (Q1926653) (← links)
- Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost (Q2174270) (← links)
- A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption (Q2203586) (← links)
- Dijkstra's algorithm and L-concave function maximization (Q2248748) (← links)
- Models and algorithms for energy-efficient scheduling with immediate start of jobs (Q2317131) (← links)
- Note on time bounds of two-phase algorithms for \(L\)-convex function minimization (Q2400167) (← links)
- A fast, accurate, and simple method for pricing European-Asian and saving-Asian options (Q2484002) (← links)
- Substitutes and complements in network flows viewed as discrete convexity (Q2581320) (← links)
- M-Convex Function on Generalized Polymatroid (Q2757584) (← links)
- Buyback Problem with Discrete Concave Valuation Functions (Q2788992) (← links)
- EQUILIBRIUM, AUCTION, AND GENERALIZED GROSS SUBSTITUTES AND COMPLEMENTS (Q2799661) (← links)
- Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines (Q2806872) (← links)
- OPTIMAL ALLOCATION PROBLEM WITH QUADRATIC UTILITY FUNCTIONS AND ITS RELATIONSHIP WITH GRAPH CUT PROBLEM (Q2869513) (← links)
- Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items (Q2872111) (← links)
- Optimal Allocation in Combinatorial Auctions with Quadratic Utility Functions (Q3010396) (← links)
- A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions (Q3075615) (← links)
- Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility under Budget Constraints (Q3092211) (← links)
- M-Convex Function Minimization by Continuous Relaxation Approach: Proximity Theorem and Algorithm (Q3105769) (← links)
- Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimization (Q3133202) (← links)
- MONOTONICITY IN STEEPEST ASCENT ALGORITHMS FOR POLYHEDRAL L-CONCAVE FUNCTIONS (Q3456031) (← links)
- Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems (Q3503231) (← links)
- Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach (Q3541133) (← links)
- NOTE ON THE CONTINUITY OF M-CONVEX AND L-CONVEX FUNCTIONS IN CONTINUOUS VARIABLES (Q3625818) (← links)
- SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION (Q3634181) (← links)
- ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS (Q3634201) (← links)
- (Q4253469) (← links)
- (Q4331292) (← links)
- An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs (Q4337655) (← links)
- A Linear Time Algorithm for Finding ak-Tree Core (Q4339005) (← links)
- (Q4367277) (← links)
- (Q4411409) (← links)