- Extension of M-convexity and L-convexity to Polyhedral Convex Functions *
- The MAOrdering MaxFlow Algorithm is Not Strongly Polynomial for Directed Networks
- POLYNOMIALTIME ALGORITHMS FOR LINEAR AND CONVEX OPTIMIZATION
- Journal of the Operations Research Society of Japan
- RIMS Preprint No. 1306, Kyoto University Quasi Mconvex and Lconvex Functions
- Mconvex and Lconvex Fuctions over the Real Space ---Two Conjugate Classes of Combinatorial Convex Functions ---1
- A Constructive Proof for the Induction of Mconvex Functions through Networks
- Substitutes and Complements in Network Flows Viewed as Discrete Convexity
- Quadratic Mconvex and Lconvex Functions Kazuo Murota a and Akiyoshi Shioura b
- Fast Scaling Algorithms for M-convex Function Minimization
- E#ciently Pricing EuropeanAsian Options ---Ultimate Implementation and Analysis of the AMO Algorithm ---
- TreeShaped Facility Location Problems and the Relationship with the Knapsack Problems
- IEICE TRANS. A, VOL. E00--A, NO. 1 JANUARY 2002 PAPER Special Section on Discrete Mathematics and Its Applications
- New Algorithms for Convex Cost Tension Problem with Application to Computer Vision$
- February 12, 2009 12:7 WSPC/INSTRUCTION FILE M#approx-dmaa-Discrete Mathematics, Algorithms and Applications
- SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION
- Journal of the Operations Research Society of Japan
- POLYNOMIAL-TIME ALGORITHMS FOR LINEAR AND CONVEX OPTIMIZATION
- MATHEMATICAL ENGINEERING TECHNICAL REPORTS
- Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra
- A Fast Algorithm for Computing a Nearly Equitable Edge Coloring
- Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times
- Minimization of an Mconvex Function 3 Akiyoshi SHIOURA y
- The Tree Center Problems and the Relationship with the Bottleneck Knapsack Problems
- Submission to Mathematics of Operations Research On Hochbaum's ProximityScaling Algorithm
- Minimum Ratio Canceling is Oracle Polynomial for Linear Programming,
- An Optimal Enumeration of Spanning Trees in an Undirected Graph Akiyoshi SHIOURA # Akihisa TAMURA + and Takeaki UNO #
- An Algorithmic Proof for the Induction of Mconvex Functions through Networks
- Journal of the Operations Research Society of Japan
- Level Set Characterization of Mconvex Functions Akiyoshi SHIOURA 3
- MATHEMATICAL ENGINEERING TECHNICAL REPORTS
- Mconvex Function on Generalized Polymatroid Kazuo MUROTA # and Akiyoshi SHIOURA +
- A Note on the Equivalence Between Substitutability and M
- A Note on the Equivalence Between Substitutability and M # convexity
- E#ciently Scanning All Spanning Trees of an Undirected Graph Akiyoshi SHIOURA
- Submission to Algorithmica A Fast, Accurate and Simple Method
- Fast Scaling Algorithms for Mconvex Function Minimization
- A Fast, Accurate and Simple Method for Pricing EuropeanAsian and SavingAsian Options
- Mathematical Programming manuscript No. (will be inserted by the editor)
- M-convex Function on Generalized Polymatroid Kazuo MUROTA
- E#ciently Pricing EuropeanAsian Options ---Ultimate Implementation and Analysis
- A Linear Time Algorithm for Finding a kTreeCore Akiyoshi SHIOURA # and Takeaki UNO #
- Optimal Allocation in Combinatorial Auctions with Quadratic Utility Functions
- Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra1 Akiyoshi SHIOURA2
- Journal of the Operations Research Society of Japan c The Operations Research Society of Japan Vol. , No. , pp.
