• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Shioura Akiyoshi  塩浦 昭義

ORCIDConnect your ORCID iD *help
… Alternative Names

SHIOURA Akiyoshi  塩浦 昭義

Less
Researcher Number 10296882
Other IDs
External Links
Affiliation (Current) 2025: 東京科学大学, 工学院, 教授
Affiliation (based on the past Project Information) *help 2019 – 2023: 東京工業大学, 工学院, 教授
2015 – 2019: 東京工業大学, 工学院, 准教授
2015: 東京工業大学, 社会理工学研究科, 准教授
2012 – 2014: 東北大学, 情報科学研究科, 准教授
2007 – 2011: Tohoku University, 大学院・情報科学研究科, 准教授 … More
2008: Tohoku University, 大学院情報科学研究科, 准教授
2006: 東北大学, 大学院情報科学研究科, 助教授
2001 – 2006: 東北大学, 大学院・情報科学研究科, 助教授
2005: 東北大学, 大学院・情報科学研究所, 助教授
1998 – 2001: 上智大学, 理工学部, 助手 Less
Review Section/Research Field
Principal Investigator
General mathematics (including Probability theory/Statistical mathematics) / Basic Section 60020:Mathematical informatics-related / Science and Engineering / General mathematics (including Probability theory/Statistical mathematics) / Mathematical informatics / Transformative Research Areas, Section (IV) / Mathematical informatics / Fundamental theory of informatics
Except Principal Investigator
Engineering fundamentals / General mathematics (including Probability theory/Statistical mathematics) … More / Engineering fundamentals / General mathematics (including Probability theory/Statistical mathematics) / Science and Engineering / 社会システム工学 Less
Keywords
Principal Investigator
離散凸解析 / アルゴリズム / 離散最適化 / 離散凸関数 / 組合せ最適化 / マトロイド / 劣モジュラ関数 / 非線形関数 / 整数計画 / 非線形計画 … More / 凸関数 / 整数計画問題 / 近似アルゴリズム / network flow / 数理計画 / 凸解析 / 凸性 / 凸集合 / algorithm / graph / flow / network / algorithms / large scale network / 多目的最適化 / 多様な解 / オークション / 最適化 / ロバスト最適化 / 計算限界 / 計算量 / DC関数 / 離散DC関数 / 非線形計画問題 / マトロスド / 近似解法 / matroid / mathematical program / nonlinear program / discrete optimization / primal algorithm / integer program / convex analysis / ネットワークフロー / 主算法 / 付値 … More
Except Principal Investigator
離散最適化 / マトロイド / アルゴリズム / 凸関数 / 非線形計画 / 凸解析 / 劣モジュラ関数 / 組合せ最適化 / convex set / matroid / convex function / convex analysis / discrete optimization / 凸集合 / 双対性 / 数理計画 / 離散凸関数 / network flow / nonlinear programming / mathematical programming / ネットワークフロー / 離散凸解析 / M凸関数最小化 / 競争均衡 / 不可分財市場 / 数理経済学 / base polyhedron / submodular function / combinatorial optimization / 付値マトロイド / 安定集合問題 / M凸劣モジュラ流問題 / スケーリング技法 / M凸関数 / 基多面体 / 最適化 / 数理工学 / 非線形関数 / 凸近似 / 整数計画 / 決定木 / 知識抽出 / クラスタリング / 計算幾何学 / 計算理論 / データマイニング / 凖凸関数 / 準凸性 / 凸性 / マトロイド(matroid) / ネットワークフロー(network flow) / 数理計画(mathematical program) / 非線形計画(nonlinear program) / 離散最適化(discrete optimization) / 主算法(primal algorithm) / 整数計画(integer program) / 凸解析(convex analysis) / 双対定理 / 不可分財 / 経済均衡 Less
  • Research Projects

    (23 results)
  • Research Products

    (176 results)
  • Co-Researchers

    (15 People)
  •  Computation of Diverse Solutions in Discrete Convex Optimization ProblemsPrincipal Investigator

    • Principal Investigator
      塩浦 昭義
    • Project Period (FY)
      2023 – 2026
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Review Section
      Basic Section 60020:Mathematical informatics-related
    • Research Institution
      Tokyo Institute of Technology
  •  Development of Algorithms for Implementation of Product-Mix AuctionPrincipal Investigator

    • Principal Investigator
      塩浦 昭義
    • Project Period (FY)
      2021 – 2022
    • Research Category
      Grant-in-Aid for Transformative Research Areas (A)
    • Review Section
      Transformative Research Areas, Section (IV)
    • Research Institution
      Tokyo Institute of Technology
  •  Research on Discrete Convex Analysis Approach for Robust Nonlinear Integer Programming ProblemsPrincipal Investigator

    • Principal Investigator
      Shioura Akiyoshi
    • Project Period (FY)
      2018 – 2022
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Review Section
      Basic Section 60020:Mathematical informatics-related
    • Research Institution
      Tokyo Institute of Technology
  •  Research on Algorithms for Network Interdiction ProblemPrincipal Investigator

    • Principal Investigator
      塩浦 昭義
    • Project Period (FY)
      2017 – 2019
    • Research Category
      Grant-in-Aid for JSPS Fellows
    • Research Field
      Mathematical informatics
    • Research Institution
      Tokyo Institute of Technology
  •  Developing Global Optimization Methods for Discrete DC Function Minimization ProblemsPrincipal Investigator

    • Principal Investigator
      Shioura Akiyoshi
    • Project Period (FY)
      2015 – 2018
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Mathematical informatics
    • Research Institution
      Tokyo Institute of Technology
  •  非線形整数計画問題の組合せ構造解析による計算限界の解明Principal Investigator

    • Principal Investigator
      塩浦 昭義
    • Project Period (FY)
      2015 – 2016
    • Research Category
      Grant-in-Aid for Scientific Research on Innovative Areas (Research in a proposed research area)
    • Review Section
      Science and Engineering
    • Research Institution
      Tokyo Institute of Technology
  •  離散凸解析に基づく劣モジュラ最適化問題の計算限界の解明Principal Investigator

    • Principal Investigator
      塩浦 昭義
    • Project Period (FY)
      2013 – 2014
    • Research Category
      Grant-in-Aid for Scientific Research on Innovative Areas (Research in a proposed research area)
    • Review Section
      Science and Engineering
    • Research Institution
      Tohoku University
  •  Development of Approximation Algorithms with Theoretical Guarantee for Integer Programming Problem with Nonlinear ConstraintPrincipal Investigator

    • Principal Investigator
      Shioura Akiyoshi
    • Project Period (FY)
      2012 – 2015
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Tokyo Institute of Technology
      Tohoku University
  •  Unified Optimization Theory by Discrete Convex Paradigm

    • Principal Investigator
      MUROTA Kazuo
    • Project Period (FY)
      2009 – 2014
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Research Field
      Engineering fundamentals
    • Research Institution
      The University of Tokyo
  •  Development of Efficient and Accurate Approximation Algorithms for Constrained Optimization of Discrete Convex FunctionsPrincipal Investigator

    • Principal Investigator
      SHIOURA Akiyoshi
    • Project Period (FY)
      2009 – 2011
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      General mathematics (including Probability theory/Statistical mathematics)
    • Research Institution
      Tohoku University
  •  Deepening and Expansion of Discrete Convexity Paradigm

    • Principal Investigator
      MUROTA Kazuo
    • Project Period (FY)
      2006 – 2008
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Research Field
      Engineering fundamentals
    • Research Institution
      The University of Tokyo
  •  Study on Practical Algorithms for Nonlinear Integer Programs Based on Discrete Convex Analysis ApproachPrincipal Investigator

    • Principal Investigator
      SHIOURA Akiyoshi
    • Project Period (FY)
      2006 – 2008
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      General mathematics (including Probability theory/Statistical mathematics)
    • Research Institution
      Tohoku University
  •  計算理論的設計による知識抽出モデルに関する研究

    • Principal Investigator
      徳山 豪
    • Project Period (FY)
      2004 – 2007
    • Research Category
      Grant-in-Aid for Scientific Research on Priority Areas
    • Review Section
      Science and Engineering
    • Research Institution
      Tohoku University
  •  離散構造の凸近似に関する研究

    • Principal Investigator
      室田 一雄
    • Project Period (FY)
      2004 – 2005
    • Research Category
      Grant-in-Aid for Exploratory Research
    • Research Field
      General mathematics (including Probability theory/Statistical mathematics)
    • Research Institution
      The University of Tokyo
  •  計算困難な整数計画問題に対する主算法アプローチに基づく厳密解法の構築Principal Investigator

    • Principal Investigator
      塩浦 昭義
    • Project Period (FY)
      2003 – 2005
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      General mathematics (including Probability theory/Statistical mathematics)
    • Research Institution
      Tohoku University
  •  Establishment of Discrete Convexity Paradigm

    • Principal Investigator
      MUROTA Kazuo
    • Project Period (FY)
      2003 – 2005
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Research Field
      Engineering fundamentals
    • Research Institution
      The University of Tokyo
  •  組合せ凸関数理論の構築と組合せ最適化問題に対する非線形計画アプローチの研究Principal Investigator

    • Principal Investigator
      塩浦 昭義
    • Project Period (FY)
      2001 – 2002
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      General mathematics (including Probability theory/Statistical mathematics)
    • Research Institution
      Tohoku University
  •  離散最適化における準凸性の理論の構築と社会工学への応用

    • Principal Investigator
      室田 一雄
    • Project Period (FY)
      2001 – 2003
    • Research Category
      Grant-in-Aid for Exploratory Research
    • Research Field
      General mathematics (including Probability theory/Statistical mathematics)
    • Research Institution
      The University of Tokyo
      Kyoto University
  •  Exploitation of Applications of Discrete Convex Analysis

    • Principal Investigator
      MUROTA Kazuo
    • Project Period (FY)
      2000 – 2002
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Research Field
      Engineering fundamentals
    • Research Institution
      The University of Tokyo
      Kyoto University
  •  付値マトロイド理論の離散最適化問題への応用Principal Investigator

    • Principal Investigator
      塩浦 昭義
    • Project Period (FY)
      1999 – 2000
    • Research Category
      Grant-in-Aid for Encouragement of Young Scientists (A)
    • Research Field
      General mathematics (including Probability theory/Statistical mathematics)
    • Research Institution
      Sophia University
  •  生産システム設計への組合せ凸解析の応用

    • Principal Investigator
      室田 一雄
    • Project Period (FY)
      1999 – 2000
    • Research Category
      Grant-in-Aid for Exploratory Research
    • Research Field
      社会システム工学
    • Research Institution
      Kyoto University
  •  離散凸解析の社会科学への展開

    • Principal Investigator
      MUROTA Kazuo
    • Project Period (FY)
      1998
    • Research Category
      Grant-in-Aid for Exploratory Research
    • Research Field
      General mathematics (including Probability theory/Statistical mathematics)
    • Research Institution
      Kyoto University
  •  Discrete Optimization Algorithms based on Discrete Convex Analysis

    • Principal Investigator
      MUROTA Kazuo
    • Project Period (FY)
      1998 – 2000
    • Research Category
      Grant-in-Aid for Scientific Research on Priority Areas (B)
    • Research Institution
      Kyoto University

All 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 Other

All Journal Article Presentation Book

  • [Book] 数理工学ライブラリー 2, 離散凸解析と最適化アルゴリズム2013

    • Author(s)
      室田一雄,塩浦昭義
    • Total Pages
      210
    • Publisher
      朝倉書店
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Book] 離散凸解析と最適化アルゴリズム2013

    • Author(s)
      室田一雄,塩浦昭義
    • Publisher
      朝倉書店
    • Data Source
      KAKENHI-PROJECT-24500002
  • [Journal Article] Characterization and algorithm for bivariate multi-unit assignment valuations2023

    • Author(s)
      Otsuka Takafumi、Shioura Akiyoshi
    • Journal Title

      Japan Journal of Industrial and Applied Mathematics

      Volume: 41 Issue: 1 Pages: 359-380

    • DOI

      10.1007/s13160-023-00597-4

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PUBLICLY-21H05848
  • [Journal Article] Preemptive scheduling of parallel jobs of two sizes with controllable processing times2023

    • Author(s)
      Shioura Akiyoshi、Strusevich Vitaly A.、Shakhlevich Natalia V.
    • Journal Title

      Journal of Scheduling

      Volume: - Issue: 2 Pages: 203-224

    • DOI

      10.1007/s10951-023-00782-w

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K11177
  • [Journal Article] Polynomial-Time Approximation Schemes for a Class of Integrated Network Design and Scheduling Problems with Parallel Identical Machines2022

    • Author(s)
      Saito Yusuke、Shioura Akiyoshi
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 13526 Pages: 324-335

    • DOI

      10.1007/978-3-031-18530-4_24

    • ISBN
      9783031185298, 9783031185304
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K11177
  • [Journal Article] TIME BOUNDS OF BASIC STEEPEST DESCENT ALGORITHMS FOR M-CONVEX FUNCTION MINIMIZATION AND RELATED PROBLEMS2021

    • Author(s)
      Minamikawa Norito、Shioura Akiyoshi
    • Journal Title

      Journal of the Operations Research Society of Japan

      Volume: 64 Issue: 2 Pages: 45-60

    • DOI

      10.15807/jorsj.64.45

    • NAID

      130008031546

    • ISSN
      0453-4514, 2188-8299
    • Year and Date
      2021-04-30
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K11177
  • [Journal Article] M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System2021

    • Author(s)
      Shioura Akiyoshi
    • Journal Title

      Mathematics of Operations Research

      Volume: - Issue: 2 Pages: 1566-1611

    • DOI

      10.1287/moor.2021.1180

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K11177
  • [Journal Article] Time bounds of basic steepest descent algorithms for M-convex function minimization and related problems2021

    • Author(s)
      Norito Minamikawa and Akiyoshi Shioura
    • Journal Title

      Journal of the Operations Research Society of Japan

      Volume: 64

    • NAID

      130008031546

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-18K11177
  • [Journal Article] A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption2020

    • Author(s)
      Fujimori Yusei、Kawase Yasushi、Matsui Tomomi、Shioura Akiyoshi
    • Journal Title

      Information Processing Letters

      Volume: 162 Pages: 105991-105991

    • DOI

      10.1016/j.ipl.2020.105991

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K11177, KAKENHI-PROJECT-20K04973
  • [Journal Article] Separable convex resource allocation problem with L1-distance constraint2019

    • Author(s)
      Norito Minamikawa, Akiyoshi Shioura
    • Journal Title

      Journal of Operations Research Society of Japan

      Volume: 発行予定

    • NAID

      130007685316

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-15K00030
  • [Journal Article] SEPARABLE CONVEX RESOURCE ALLOCATION PROBLEM WITH L1-DISTANCE CONSTRAINT2019

    • Author(s)
      Minamikawa Norito、Shioura Akiyoshi
    • Journal Title

      Journal of the Operations Research Society of Japan

      Volume: 62 Issue: 3 Pages: 109-120

    • DOI

      10.15807/jorsj.62.109

    • NAID

      130007685316

    • ISSN
      0453-4514, 2188-8299
    • Year and Date
      2019-07-31
    • Language
      English
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-18K11177
  • [Journal Article] Separable convex resource allocation problem with L1-distance constraint2019

    • Author(s)
      Norito Minamikawa, Akiyoshi Shioura
    • Journal Title

      Journal of Operations Research Society of Japan

      Volume: 印刷中

    • NAID

      130007685316

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K11177
  • [Journal Article] Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches2018

    • Author(s)
      Shioura Akiyoshi、Shakhlevich Natalia V.、Strusevich Vitaly A.
    • Journal Title

      European Journal of Operational Research

      Volume: 266 Issue: 3 Pages: 795-818

    • DOI

      10.1016/j.ejor.2017.08.034

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15K00030
  • [Journal Article] Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost2018

    • Author(s)
      Shioura Akiyoshi、Shakhlevich Natalia V.、Strusevich Vitaly A.
    • Journal Title

      Journal of Global Optimization

      Volume: 発行予定 Issue: 3 Pages: 471-490

    • DOI

      10.1007/s10898-018-0686-2

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15K00030, KAKENHI-PROJECT-18K11177
  • [Journal Article] Algorithms for L-convex Function Minimization: Connection Between Discrete Convex Analysis and Other Research Fields2017

    • Author(s)
      Akiyoshi Shioura
    • Journal Title

      Journal of Operations Research Society of Japan

      Volume: 印刷中

    • NAID

      130005874249

    • Peer Reviewed / Acknowledgement Compliant / Open Access
    • Data Source
      KAKENHI-PUBLICLY-15H00848
  • [Journal Article] Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints2017

    • Author(s)
      Akiyoshi Shioura, Natalia V. Shakhlevich, and Vitaly A. Strusevich
    • Journal Title

      INFORMS Journal on Computing

      Volume: 印刷中

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PUBLICLY-15H00848
  • [Journal Article] Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints2017

    • Author(s)
      Akiyoshi Shioura, Natalia V. Shakhlevich, and Vitaly A. Strusevich
    • Journal Title

      INFORMS Journal on Computing

      Volume: 印刷中

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15K00030
  • [Journal Article] Note on time bounds of two-phase algorithms for L-convex function minimization2017

    • Author(s)
      Murota Kazuo、Shioura Akiyoshi
    • Journal Title

      Japan Journal of Industrial and Applied Mathematics

      Volume: 34 Issue: 2 Pages: 429-440

    • DOI

      10.1007/s13160-017-0246-z

    • NAID

      210000169651

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-15K00030, KAKENHI-PROJECT-26280004
  • [Journal Article] Algorithms for L-convex Function Minimization: Connection Between Discrete Convex Analysis and Other Research Fields2017

    • Author(s)
      Akiyoshi Shioura
    • Journal Title

      Journal of Operations Research Society of Japan

      Volume: 印刷中

    • NAID

      130005874249

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-15K00030
  • [Journal Article] Buyback problem with discrete concave valuation functions2017

    • Author(s)
      Fukuda Shun、Shioura Akiyoshi、Tokuyama Takeshi
    • Journal Title

      Discrete Optimization

      Volume: 26 Pages: 78-96

    • DOI

      10.1016/j.disopt.2017.07.002

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-15K00030
  • [Journal Article] Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines2016

    • Author(s)
      A. Shioura, N. V. Shakhlevich, and V. A. Strusevich
    • Journal Title

      INFORMS Journal on Computing

      Volume: 28 Issue: 1 Pages: 148-161

    • DOI

      10.1287/ijoc.2015.0660

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26280004, KAKENHI-PUBLICLY-15H00848
  • [Journal Article] Buyback Problem with Discrete Concave Valuation Functions2016

    • Author(s)
      S. Fukuda, A. Shioura, and T. Tokuyama
    • Journal Title

      Proceedings of the 13th International Workshop on Approximation and Online Algorithms (WAOA 2015)

      Volume: LNCS 9499 Pages: 72-83

    • DOI

      10.1007/978-3-319-28684-6_7

    • ISBN
      9783319286839, 9783319286846
    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-15K00030, KAKENHI-PLANNED-24106007, KAKENHI-PROJECT-15H02665
  • [Journal Article] Time bounds for iterative auctions: a unified approach by discrete convex analysis2016

    • Author(s)
      K. Murota, A. Shioura, and Z. Yang
    • Journal Title

      Discrete Optimization

      Volume: 19 Pages: 36-62

    • DOI

      10.1016/j.disopt.2016.01.001

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15K00030, KAKENHI-PROJECT-24500002, KAKENHI-PROJECT-26280004, KAKENHI-PUBLICLY-15H00848
  • [Journal Article] Stability and competitive equilibria in multi-unit trading networks with discrete concave utility functions2015

    • Author(s)
      Ikebe Y. T, Sekiguchi, Y., Shioura, A. and Tamura, A.
    • Journal Title

      Japan Journal of Industrial and Applied Mathematics

      Volume: 32 Issue: 2 Pages: 373-410

    • DOI

      10.1007/s13160-015-0175-7

    • NAID

      210000181655

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-24300003, KAKENHI-PROJECT-24220003, KAKENHI-PROJECT-24500002, KAKENHI-PROJECT-26280004, KAKENHI-PUBLICLY-15H00848
  • [Journal Article] Gross Substitutes Condition and Discrete Concavity for Multi-Unit Valuations: A Survey2015

    • Author(s)
      Akiyoshi Shioura and Akihisa Tamura
    • Journal Title

      Journal of Operations Research Society of Japan

      Volume: 58 Pages: 61-103

    • NAID

      130005067217

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-24500002
  • [Journal Article] Decomposition Algorithms for Submodular Optimization with Applications to Parallel Machine Scheduling with Controllable Processing Times2015

    • Author(s)
      Akiyoshi Shioura, Natalia V. Shakhlevich, and Vitaly A. Strusevich
    • Journal Title

      Mathematical Programming

      Volume: 印刷中 Issue: 2 Pages: 495-534

    • DOI

      10.1007/s10107-014-0814-9

    • Peer Reviewed / Acknowledgement Compliant / Open Access
    • Data Source
      KAKENHI-PROJECT-24500002, KAKENHI-PROJECT-26280004
  • [Journal Article] MONOTONICITY IN STEEPEST ASCENT ALGORITHMS FOR POLYHEDRAL L-CONCAVE FUNCTIONS2015

    • Author(s)
      S. Fujishige, K. Murota, and A. Shioura
    • Journal Title

      Journal of the Operations Research Society of Japan

      Volume: 58 Issue: 2 Pages: 184-208

    • DOI

      10.15807/jorsj.58.184

    • NAID

      130005083503

    • ISSN
      0453-4514, 2188-8299
    • Language
      English
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-15K00030, KAKENHI-PROJECT-25280004, KAKENHI-PROJECT-26280004, KAKENHI-PUBLICLY-15H00848
  • [Journal Article] EQUILIBRIUM, AUCTION, AND GENERALIZED GROSS SUBSTITUTES AND COMPLEMENTS2015

    • Author(s)
      A. Shioura and Z. Yang
    • Journal Title

      Journal of the Operations Research Society of Japan

      Volume: 58 Issue: 4 Pages: 410-435

    • DOI

      10.15807/jorsj.58.410

    • NAID

      130005108556

    • ISSN
      0453-4514, 2188-8299
    • Language
      English
    • Peer Reviewed / Acknowledgement Compliant / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-24500002, KAKENHI-PROJECT-26280004, KAKENHI-PUBLICLY-15H00848
  • [Journal Article] Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility under Budget Constraints2015

    • Author(s)
      Akiyoshi Shioura
    • Journal Title

      Mathematics of Operations Research

      Volume: 40 Issue: 1 Pages: 171-191

    • DOI

      10.1287/moor.2014.0668

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-24500002, KAKENHI-PUBLICLY-25106503, KAKENHI-PROJECT-26280004
  • [Journal Article] Exact bounds for steepest descent algorithms of L-convex function minimization2014

    • Author(s)
      K. Murota and A. Shioura
    • Journal Title

      Operations Research Letters

      Volume: 42 Pages: 361-366

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Journal Article] Dijkstra's algorithm and L-concave function maximization2014

    • Author(s)
      K. Murota and A. Shioura
    • Journal Title

      Mathematical Programming, Series A

      Volume: 145 Issue: 1-2 Pages: 163-177

    • DOI

      10.1007/s10107-013-0643-2

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21360045, KAKENHI-PROJECT-24500002
  • [Journal Article] Exact Bounds for Steepest Descent Algorithms of L-convex Function Minimization2014

    • Author(s)
      Kazuo Murota and Akiyoshi Shioura
    • Journal Title

      Operations Research Letters

      Volume: 42 Issue: 5 Pages: 361-366

    • DOI

      10.1016/j.orl.2014.06.005

    • Peer Reviewed
    • Data Source
      KAKENHI-PUBLICLY-25106503
  • [Journal Article] A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines2013

    • Author(s)
      Natalia V. Shakhlevich, Akiyoshi Shioura, and Vitaly A. Strusevich
    • Journal Title

      SIAM Journal on Discrete Mathematics

      Volume: 27 Issue: 1 Pages: 186-204

    • DOI

      10.1137/110843836

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-24500002
  • [Journal Article] Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items2013

    • Author(s)
      Kazuo, Murota, Akiyoshi Shioura, Zaifu Yang
    • Journal Title

      Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC 2013)

      Volume: LNCS 8283 Pages: 468-478

    • DOI

      10.1007/978-3-642-45030-3_44

    • ISBN
      9783642450297, 9783642450303
    • Peer Reviewed
    • Data Source
      KAKENHI-PUBLICLY-25106503
  • [Journal Article] Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra2012

    • Author(s)
      A. Shioura
    • Journal Title

      SIAM Journal on Discrete Mathematics

      Volume: 26 Pages: 114-144

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21740060
  • [Journal Article] Matroid rank functions and discrete concavity2012

    • Author(s)
      A. Shioura
    • Journal Title

      Japan Journal of Industrial and Applied Mathematics

      Volume: 29 Issue: 3 Pages: 535-546

    • DOI

      10.1007/s13160-012-0082-0

    • NAID

      10031126882

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21360045, KAKENHI-PROJECT-24500002
  • [Journal Article] Optimal Allocation Problem with Quadratic Utility Functions and Its Relationship with Graph Cut Problem2012

    • Author(s)
      A. Shioura, S. Suzuki
    • Journal Title

      Journal of Operations Research Society of Japan

      Volume: 55 Pages: 92-105

    • NAID

      110009436529

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21740060
  • [Journal Article] M-convex function minimization by continuous relaxation approach : proximity theorem and algorithm2011

    • Author(s)
      S.Moriguchi, A.Shioura, N.Tsuchimura
    • Journal Title

      SIAM Journal on Optimization

      Volume: 21-3 Pages: 633-668

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Journal Article] M-convex Function Minimization by Continuous Relaxation Approach : Proximity Theorem and Algorithm2011

    • Author(s)
      S. Moriguchi, A. Shioura, N. Tsuchimura
    • Journal Title

      SIAM Journal on Optimization

      Volume: 21 Pages: 633-668

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21740060
  • [Journal Article] M-convex Function Minimization by Continuous Relaxation Approach…Proximity Theorem and Algorithm…2011

    • Author(s)
      Satoko Moriguchi, Akiyoshi Shioura, Nobuyuki Tsuchimura
    • Journal Title

      SIAM Journal on Optimization

      Volume: 21 Pages: 633-668

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21740060
  • [Journal Article] A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions2010

    • Author(s)
      A. Shioura, M. Yagiura
    • Journal Title

      Journal of Graph Algorithms and Applications

      Volume: 13 Pages: 391-407

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21740060
  • [Journal Article] A Fast Algorithm for Computing a Nearly Equitable Edge Colorling with Balanced Conditions2010

    • Author(s)
      A.Shioura, M.Yagiura
    • Journal Title

      Journal of Graph Algorithms and Applications

      Volume: 14(2) Pages: 391-407

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Journal Article] A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions2010

    • Author(s)
      Akiyoshi Shioura, Mutsunori Yagiura
    • Journal Title

      Journal of Graph Algorithms and Applications

      Volume: 14 Pages: 391-407

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21740060
  • [Journal Article] New Algorithms for Convex Cost Tension Problem with Application to Computer Vision2009

    • Author(s)
      V.Kolmogorov, A.Shioura
    • Journal Title

      Discrete Optimization

      Volume: 6(4) Pages: 378-393

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Journal Article] On the Pipage Rounding Algorithm for Submodular Function Maximization2009

    • Author(s)
      Akiyoshi Shioura
    • Journal Title

      Discrete Mathematics, Algorithms and Applications 1(出版予定)

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18740042
  • [Journal Article] New Algorithms for Convex Cost Tension Problem with Application to Computer Vision2009

    • Author(s)
      V. Kolmogorov, A. Shioura
    • Journal Title

      Discrete Optimization

      Volume: 6 Pages: 378-393

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21740060
  • [Journal Article] New Algorithms for Convex Cost Tension Problem with Application to Computer Vision2009

    • Author(s)
      Vladimir Kolmogorov, Akiyoshi Shioura
    • Journal Title

      Discrete Optimization 6

      Pages: 378-393

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21740060
  • [Journal Article] Single Machine Scheduling with Controllable Processing Times by Submodular Optimization2009

    • Author(s)
      N.V.Shakhlevich, A.Shioura, V.A.Strusevich
    • Journal Title

      International Journal of Foundations of Computer Science

      Volume: 20(2) Pages: 247-269

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Journal Article] Single Machine Scheduling with Controllable Processing Times by Submodular Optimization2009

    • Author(s)
      N. Shakhlevich, A. Shioura, V. Strusevich
    • Journal Title

      International Journal of Foundations of Computer Science

      Volume: 20 Pages: 247-269

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21740060
  • [Journal Article] On the Pipage Rounding Algorithm for Submodular Function Max imization ---A View from Discrete Convex Analysis---2009

    • Author(s)
      A.Shioura
    • Journal Title

      Discrete Mathematics, Algorithms and Applications

      Volume: 1(1) Pages: 1-23

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Journal Article] Single Machine Scheduling with Controllable Processing Times by Submodular Optimization2009

    • Author(s)
      Natalia Shakhlevich, Akiyoshi Shioura, Vitaly Strusevich
    • Journal Title

      International Journal of Foundations of Computer Science 20

      Pages: 247-269

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21740060
  • [Journal Article] On the Pipage Rounding Algorithm for Submodular Function Maximization2009

    • Author(s)
      Akiyoshi Shioura
    • Journal Title

      Discrete Mathematics, Algorithms, and Applications 1

      Pages: 1-23

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18740042
  • [Journal Article] Note on the continuity of M-convex and L-convex functions in continuous variables2008

    • Author(s)
      K. Murota, A. Shioura
    • Journal Title

      Journal of Operations Research Society of Japan Vol.51, No.4

      Pages: 265-273

    • NAID

      110007008320

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18360048
  • [Journal Article] Note on the Continuity of M-convex and L-convex Functions in Continuous Variables2008

    • Author(s)
      Kazuo Murota, Akiyoshi Shioura
    • Journal Title

      Journal of the Operations Research Society of Japan 51

      Pages: 265-273

    • NAID

      110007008320

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18740042
  • [Journal Article] Note on the continuity of M-convex and L-convex functions in continuous variables2008

    • Author(s)
      K.Murota, A.Shioura
    • Journal Title

      Journal of Operations Research Society of Japan 51-4

      Pages: 265-273

    • NAID

      110007008320

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18360048
  • [Journal Article] Polynomial-time Algorithms for Linear and Convex Optimization on Jump Systems2007

    • Author(s)
      A. Shioura, K. Tanaka
    • Journal Title

      SIAM Journal on Discrete Mathematics 21

      Pages: 504-522

    • NAID

      120002337749

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18740042
  • [Journal Article] Polynomial-time Algorithms for Linear and Convex Optimization on Jump Systems2007

    • Author(s)
      Akiyoshi Shioura, Ken'ichiro Tanaka
    • Journal Title

      SIAM Journal on Discrete Mathematics 21

      Pages: 504-522

    • NAID

      120002337749

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18740042
  • [Journal Article] Efficiently Pricing European-Asian Options : Ultimate Implementation and Analysis of the AMO Algorithm2006

    • Author(s)
      Akiyoshi Shioura, Takeshi Tokuyama
    • Journal Title

      Information Processing Letters 100巻6号

      Pages: 213-219

    • NAID

      110002812022

    • Data Source
      KAKENHI-PROJECT-18740042
  • [Journal Article] Efficiently Pricing European-Asian Options: Ultimate Implementation and Analysis of the AMO Algorithm2006

    • Author(s)
      Akiyoshi Shioura, Takeshi Tokuyama
    • Journal Title

      Information Processing Letters 100

      Pages: 213-219

    • NAID

      110002812022

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18740042
  • [Journal Article] Efficient Strategy Proof Fair Allocation Algorithms2006

    • Author(s)
      Akiyoshi Shioura, Ning Sun, and Zaifu Yang
    • Journal Title

      Journal of the Operations Research Society of Japan 49

      Pages: 144-150

    • NAID

      110004737675

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18740042
  • [Journal Article] Efficiently Pricing European-Asian Options : Ultimate Implementation and Analysis of the AMO Algorithm2006

    • Author(s)
      A.Shioura, T.Tokuyama
    • Journal Title

      Information Processing Letters 100-6

      Pages: 213-219

    • NAID

      110002812022

    • Data Source
      KAKENHI-PROJECT-16092202
  • [Journal Article] Efficient Strategy Proof Fair Allocation Algorithms2006

    • Author(s)
      Akiyoshi Shioura, Ning Sun, Zaifu Yang
    • Journal Title

      Journal of the Operations Research Society of Japan 49巻2号

      Pages: 144-150

    • NAID

      110004737675

    • Data Source
      KAKENHI-PROJECT-18740042
  • [Journal Article] A Fast, Accurate and Simple Method for Pricing European-Asian and Saying-Asian Options2005

    • Author(s)
      K.Ohta, K.Sadakane, A.Shioura, T.Tokuyama
    • Journal Title

      Algorithmic 掲載予定

    • Data Source
      KAKENHI-PROJECT-15740050
  • [Journal Article] Substitutes and complements in network flows viewed as discrete convexity2005

    • Author(s)
      K.Murota, A.Shioura
    • Journal Title

      Discrete Optimization 2

      Pages: 256-268

    • Data Source
      KAKENHI-PROJECT-16654019
  • [Journal Article] A note on the equivalence between substitutability and M^# -convexity2005

    • Author(s)
      R.Farooq, A.Shioura
    • Journal Title

      Pacific Journal of optimization 1

      Pages: 243-252

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-15360043
  • [Journal Article] Substitutes and complements in network flows viewed as discrete convexity2005

    • Author(s)
      K.Murota, A.Shioura
    • Journal Title

      Discrete Optimization 2

      Pages: 256-268

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-15360043
  • [Journal Article] A Note on the Equivalence Between Substitutability and M$^natural $-convexity2005

    • Author(s)
      R.Farooq, A.Shioura
    • Journal Title

      Pacific Journal of Optimization 1

      Pages: 243-252

    • Data Source
      KAKENHI-PROJECT-15740050
  • [Journal Article] A note on the equivalence between substitutability and M〓-convexity2005

    • Author(s)
      R.Farooq, A.Shioura
    • Journal Title

      Pacific Journal of Optimization 1

      Pages: 243-252

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-15360043
  • [Journal Article] Substitutes and Complements in Network Flows Viewed as Discrete Convexity2005

    • Author(s)
      K.Murota, A.Shioura
    • Journal Title

      Discrete Optimization 2(3)

      Pages: 256-268

    • Data Source
      KAKENHI-PROJECT-16092202
  • [Journal Article] Substitutes and complements in network flows viewed as discrete convexity2005

    • Author(s)
      Kazuo Murota, Akiyoshi Shioura
    • Journal Title

      Discrete Optimization 2(3)

      Pages: 256-268

    • Data Source
      KAKENHI-PROJECT-15740050
  • [Journal Article] Substitutes and complements in network flows viewed as discrete convexity2005

    • Author(s)
      K.Murota, A.Shioura
    • Journal Title

      Discrete optimization 2

      Pages: 256-268

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-15360043
  • [Journal Article] A Note on the equivalence between substitutability and M*-convexity2005

    • Author(s)
      R.Farooq, A.Shioura
    • Journal Title

      Pacific Journal of Optimization 1

      Pages: 243-252

    • Data Source
      KAKENHI-PROJECT-16654019
  • [Journal Article] A Fast, Accurate and Simple Method for Pricing European-Asian and Saving-Asian Options2005

    • Author(s)
      Ken'ichiro Ohta, Kunihiko Sadakane, Akiyoshi Shioura, Takeshi Tokuyama
    • Journal Title

      Algorithmica 42(2)

      Pages: 141-158

    • NAID

      110002812510

    • Data Source
      KAKENHI-PROJECT-15740050
  • [Journal Article] The MA-ordering max-flow algorithm is not strongly polynomial for directed networks2004

    • Author(s)
      A.Shioura
    • Journal Title

      Operations Research Letters 32

      Pages: 31-35

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-15360043
  • [Journal Article] On Hochbaum's scaling algorithm for the general resource allocation problem2004

    • Author(s)
      S.Moriguchi, A.Shioura
    • Journal Title

      Mathematics of Operations Research 29

      Pages: 394-397

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-15360043
  • [Journal Article] Conjugacy relationship between M-convex and L-convex functions in continuous variables2004

    • Author(s)
      K.Murota, A.Shioura
    • Journal Title

      Mathematical Programming 101

      Pages: 415-433

    • Data Source
      KAKENHI-PROJECT-16654019
  • [Journal Article] On Hochbaum's scaling algorithm for the general resource allocation problem2004

    • Author(s)
      S.Moriguchi, A.Shioura
    • Journal Title

      Mathematics of Operations Research 29

      Pages: 394-397

    • Data Source
      KAKENHI-PROJECT-16654019
  • [Journal Article] Efficiently Pricing European-Asian Options : Ultimate Implementation and Analysis the AMO Algorithm2004

    • Author(s)
      A.Shioura, T.Tokuyama
    • Journal Title

      情報処理学会研究報告 96

      Pages: 43-50

    • NAID

      110002812022

    • Data Source
      KAKENHI-PROJECT-15740050
  • [Journal Article] On Hochbaum's Scaling Algorithm for the General Resource Allocation Problem2004

    • Author(s)
      S.Moriguchi, A.Shioura
    • Journal Title

      Mathematics of Operations Research 29

      Pages: 394-397

    • Data Source
      KAKENHI-PROJECT-15740050
  • [Journal Article] Fundamental properties of M-convex and L-convex functions in continuous veriables2004

    • Author(s)
      K.Murota, A.Shioura
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E87-A

      Pages: 1042-1052

    • Data Source
      KAKENHI-PROJECT-16654019
  • [Journal Article] Conjugacy relationship between M-convex and L-convex functions in continuous variables2004

    • Author(s)
      K.Murota, A.Shioura
    • Journal Title

      Mathematical Programming 101

      Pages: 415-433

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-15360043
  • [Journal Article] Fast scaling algorithms for M-convex function Minimization with application to the resource allocation problem2004

    • Author(s)
      A.Shioura
    • Journal Title

      Discrete Applied Mathematics 134

      Pages: 303-316

    • NAID

      110003178709

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-15360043
  • [Journal Article] Quadratic M-convex and L-convex functions2004

    • Author(s)
      K.Murota, A.Shioura
    • Journal Title

      Advances in Applied Mathematics 33

      Pages: 318-341

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-15360043
  • [Journal Article] Fundamental Properties of M-convex and L-convex Functions in continuous Variables2004

    • Author(s)
      K.Murota, A.Shioura
    • Journal Title

      IEICE Transactions on Fundamentals E87-A

      Pages: 1042-1052

    • NAID

      110003213000

    • Data Source
      KAKENHI-PROJECT-15740050
  • [Journal Article] Conjugacy Relationship between M-convex and L-convex Functions in Continuous Variables2004

    • Author(s)
      K.Murota, A.Shioura
    • Journal Title

      Mathematical Programming 101

      Pages: 415-433

    • Data Source
      KAKENHI-PROJECT-15740050
  • [Journal Article] Fundamental properties of M-convex and L-convex functions in continuous variables2004

    • Author(s)
      K.Murota, A.Shioura
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E87-A

      Pages: 1042-1052

    • NAID

      110003213000

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-15360043
  • [Journal Article] Quadratic M-convex and L-convex functions2004

    • Author(s)
      K.Murota, A.Shioura
    • Journal Title

      Advances in Applied Mathematics 33

      Pages: 318-341

    • Data Source
      KAKENHI-PROJECT-16654019
  • [Journal Article] Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem2004

    • Author(s)
      A.Shioura
    • Journal Title

      Discrete Applied Mathematics 134

      Pages: 303-316

    • NAID

      110003178709

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-15360043
  • [Journal Article] Quasi M-convex and L-convex Functions---Quasi-convexity in discrete optimization2003

    • Author(s)
      K.Murota, A.Shioura
    • Journal Title

      Discrete Applied Mathematics 131/132

      Pages: 467-494

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-15360043
  • [Journal Article] Quasi M-convex and L-convex functions ・・・ Quasi-convexity in discrete optimization2003

    • Author(s)
      K.Murota, A.Shioura
    • Journal Title

      Discrete Applied Mathematics 131/132

      Pages: 467-494

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-15360043
  • [Journal Article] Polynomial-time Algorithms for Linear and Convex Optimization on Jump Systems

    • Author(s)
      Akiyoshi Shioura, Ken'ichiro Tanaka
    • Journal Title

      SIAM Journal on Discrete Mathematics (掲載予定)

    • NAID

      120002337749

    • Data Source
      KAKENHI-PROJECT-18740042
  • [Presentation] Characterization and Algorithm for Bivariate Multi-Unit Assignment Valuations2023

    • Author(s)
      Takafumi Otsuka, Akiyoshi Shioura
    • Organizer
      Fifth Conference on Discrete Optimization and Machine Learning
    • Invited / Int'l Joint Research
    • Data Source
      KAKENHI-PUBLICLY-21H05848
  • [Presentation] Algorithm for Computing Representation of Bivariate Multi-Unit Assignment Valuations2023

    • Author(s)
      Takafumi Otsuka, Akiyoshi Shioura
    • Organizer
      第193回アルゴリズム研究発表会
    • Data Source
      KAKENHI-PUBLICLY-21H05848
  • [Presentation] 全域木設計スケジューリング問題の近似解法2022

    • Author(s)
      齊藤 雄介, 塩浦 昭義
    • Organizer
      京都大学数理解析研究所RIMS共同研究(公開型) 「情報社会を支える計算機科学の基礎理論」
    • Data Source
      KAKENHI-PROJECT-18K11177
  • [Presentation] 全域木設計スケジューリング問題の近似解法2022

    • Author(s)
      齊藤 雄介, 塩浦 昭義
    • Organizer
      日本オペレーションズ・リサーチ学会 2022年春季研究発表会
    • Data Source
      KAKENHI-PROJECT-18K11177
  • [Presentation] Polynomial-Time Approximation Schemes for a Class of Integrated Network Design and Scheduling Problems with Parallel Identical Machines2022

    • Author(s)
      Yusuke Saito, Akiyoshi Shioura
    • Organizer
      第188回アルゴリズム研究発表会
    • Data Source
      KAKENHI-PROJECT-18K11177
  • [Presentation] Polynomial-Time Approximation Schemes for a Class of Integrated Network Design and Scheduling Problems with Parallel Identical Machines2022

    • Author(s)
      Yusuke Saito, Akiyoshi Shioura
    • Organizer
      International Symposium on Combinatorial Optimization
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K11177
  • [Presentation] M凸関数最小化問題に対する最急降下法の反復回数の厳密なバウンド2020

    • Author(s)
      南川 智都, 塩浦 昭義
    • Organizer
      京都大学数理解析研究所研究集会「数理最適化の理論・アルゴリズム・応用」
    • Data Source
      KAKENHI-PROJECT-18K11177
  • [Presentation] M凸関数最小化問題に対する最急降下法の反復回数の解析2020

    • Author(s)
      南川 智都, 塩浦 昭義
    • Organizer
      日本応用数理学会 2020年度 年会
    • Data Source
      KAKENHI-PROJECT-18K11177
  • [Presentation] M凸関数最小化問題に対する最急降下法の厳密な反復回数2020

    • Author(s)
      南川 智都, 塩浦 昭義
    • Organizer
      情報処理学会 第178回アルゴリズム研究会
    • Data Source
      KAKENHI-PROJECT-18K11177
  • [Presentation] M-convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Re-allocation in Bike Sharing System2019

    • Author(s)
      Akiyoshi Shioura
    • Organizer
      11th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K11177
  • [Presentation] L1距離制約の下でのM凸関数最小化2019

    • Author(s)
      塩浦昭義
    • Organizer
      研究集会「最適化:モデリングとアルゴリズム」
    • Data Source
      KAKENHI-PROJECT-18K11177
  • [Presentation] Connection Between Discrete Convex Analysis and Auction Theory2019

    • Author(s)
      Akiyoshi Shioura
    • Organizer
      SIAM Conference on Applied Algebraic Geometry
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K11177
  • [Presentation] Minimization of an M-convex Function under L1-distance Constraint2018

    • Author(s)
      塩浦昭義
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Data Source
      KAKENHI-PROJECT-18K11177
  • [Presentation] Max-Cost Scheduling with Controllable Processing Times and a Common Deadline2018

    • Author(s)
      Vitaly Strusevich, Akiyoshi Shioura, Natalia Shakhlevich
    • Organizer
      23rd International Symposium on Mathematical Programming
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K11177
  • [Presentation] Polynomial-time Algorithms for Dock Reallocation Problem in Bike Sharing System2018

    • Author(s)
      塩浦昭義
    • Organizer
      情報処理学会アルゴリズム研究会
    • Data Source
      KAKENHI-PROJECT-18K11177
  • [Presentation] Algorithms for Separable Convex Resource Allocation Problem with L1-distance Constraint2018

    • Author(s)
      南川 智都, 塩浦 昭義
    • Organizer
      21st Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2018)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15K00030
  • [Presentation] L1距離制約をもつ分離凸資源配分問題に対するアルゴリズム2018

    • Author(s)
      南川 智都, 塩浦 昭義
    • Organizer
      第168回アルゴリズム研究会
    • Data Source
      KAKENHI-PROJECT-15K00030
  • [Presentation] L1距離制約をもつ分離凸資源配分問題2018

    • Author(s)
      南川 智都, 塩浦 昭義
    • Organizer
      日本オペレーションズ・リサーチ学会2018年秋季研究発表会
    • Data Source
      KAKENHI-PROJECT-15K00030
  • [Presentation] 複数財に対する繰り返しオークションと離散凸解析の繋がり2017

    • Author(s)
      塩浦昭義
    • Organizer
      日本オペレーションズ・リサーチ学会関西支部記念講演会
    • Place of Presentation
      関西大学うめきたラボラトリ(大阪市北区)
    • Year and Date
      2017-03-11
    • Invited
    • Data Source
      KAKENHI-PUBLICLY-15H00848
  • [Presentation] 複数財に対する繰り返しオークションと離散凸解析の繋がり2017

    • Author(s)
      塩浦昭義
    • Organizer
      日本オペレーションズ・リサーチ学会関西支部記念講演会
    • Place of Presentation
      関西大学うめきたラボラトリ(大阪市北区)
    • Year and Date
      2017-03-11
    • Invited
    • Data Source
      KAKENHI-PROJECT-15K00030
  • [Presentation] 離散最適化の基礎としての離散凸解析2017

    • Author(s)
      塩浦昭義
    • Organizer
      電子情報通信学会ソサエティ大会
    • Invited
    • Data Source
      KAKENHI-PROJECT-15K00030
  • [Presentation] Time Bounds of Two-Phase Algorithms for L-convex Function Minimization2017

    • Author(s)
      Akiyoshi Shioura
    • Organizer
      10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15K00030
  • [Presentation] 離散凸解析をひろげる2016

    • Author(s)
      塩浦昭義
    • Organizer
      日本オペレーションズ・リサーチ学会2016年春季研究発表会
    • Place of Presentation
      慶應義塾大学矢上キャンパス(神奈川県横浜市港北区)
    • Year and Date
      2016-03-18
    • Invited
    • Data Source
      KAKENHI-PROJECT-15K00030
  • [Presentation] Analysis of L-convex Function Minimization Algorithms and Application to Auction Theory2015

    • Author(s)
      Akiyoshi Shioura
    • Organizer
      Workshop on Rigidity, Submodularity, Discrete Convexity
    • Place of Presentation
      Hausdorff Research Institute for Mathematics (Bonn, Germany)
    • Year and Date
      2015-10-06
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15K00030
  • [Presentation] Exact Bounds for Steepest Descent Algorithms of L-convex Function Minimization2015

    • Author(s)
      Akiyoshi Shioura
    • Organizer
      22nd International Symposium on Mathematical Programming
    • Place of Presentation
      Wyndham Grand Pittsburgh Downtown (Pittsburgh, USA)
    • Year and Date
      2015-07-17
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-24500002
  • [Presentation] Analysis of L-convex Function Minimization Algorithms and Application to Auction Theory2015

    • Author(s)
      Kazuo Murota and Akiyoshi Shioura
    • Organizer
      Workhosp on Rigidity, Submodularity, Discrete Convexity
    • Place of Presentation
      Hausdorff Research Institute for Mathematics (Bonn, Germany)
    • Year and Date
      2015-10-05
    • Invited / Int'l Joint Research
    • Data Source
      KAKENHI-PUBLICLY-15H00848
  • [Presentation] Buyback Problem with Discrete Concave Valuation Functions2015

    • Author(s)
      Akiyoshi Shioura
    • Organizer
      13th International Workshop on Approximation and Online Algorithms (WAOA 2015)
    • Place of Presentation
      University of Patras (Patras, Greece)
    • Year and Date
      2015-09-17
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15K00030
  • [Presentation] Nonlinear Buyback Problem with Discrete Concave Valuation Functions2015

    • Author(s)
      Shun Fukuda, Akiyoshi Shioura, Takeshi Tokuyama
    • Organizer
      13th Workshop on Approximation and Online Algorithms
    • Place of Presentation
      University of Patras (Patras, Greece)
    • Year and Date
      2015-09-17
    • Invited / Int'l Joint Research
    • Data Source
      KAKENHI-PUBLICLY-15H00848
  • [Presentation] L凸関数の最小化アルゴリズム:離散凸解析と諸分野との繋がり2015

    • Author(s)
      塩浦昭義
    • Organizer
      第27回RAMPシンポジウム
    • Place of Presentation
      静岡大学浜松キャンパス(静岡県浜松市)
    • Year and Date
      2015-10-15
    • Invited
    • Data Source
      KAKENHI-PROJECT-15K00030
  • [Presentation] Speed Scaling Scheduling Viewed from Submodular Optimization2015

    • Author(s)
      塩浦昭義
    • Organizer
      応用数理学会研究部会連合発表会
    • Place of Presentation
      明治大学中野キャンパス(東京都中野区)
    • Year and Date
      2015-03-06
    • Data Source
      KAKENHI-PROJECT-24500002
  • [Presentation] L凸関数の最小化アルゴリズム:離散凸解析と諸分野との繋がり2015

    • Author(s)
      塩浦昭義
    • Organizer
      第27回RAMPシンポジウム
    • Place of Presentation
      静岡大学浜松キャンパス(静岡県浜松市)
    • Year and Date
      2015-10-15
    • Invited
    • Data Source
      KAKENHI-PROJECT-24500002
  • [Presentation] Time complexity analysis of iterative auctions with multiple differentiated items2014

    • Author(s)
      K. Murota and A. Shioura, and Z. Yang
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      東北大学(宮城県仙台市)
    • Year and Date
      2014-04-24
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Presentation] Time Complexity Analysis of Iterative Auctions with Multiple Differentiated Items2014

    • Author(s)
      塩浦昭義
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      東北大学(宮城県仙台市)
    • Year and Date
      2014-04-24
    • Data Source
      KAKENHI-PUBLICLY-25106503
  • [Presentation] Stability and competitive equilibrium in extended trading networks with discrete concave utility functions2014

    • Author(s)
      Y.T. Ikebe, Y. Sekiguchi, A. Shioura and A. Tamura
    • Organizer
      The Second International Workshop on Market Design Technologies for Substainable Development
    • Place of Presentation
      Keio University(横浜市港北区)
    • Year and Date
      2014-08-17
    • Invited
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Presentation] Minimization of L-convex Function and Its Application2014

    • Author(s)
      Akiyoshi Shioura
    • Organizer
      2014 Bilateral Workshop between Tohoku University and National Tsing Hua University
    • Place of Presentation
      ホテル松島大観荘(宮城県松島町)
    • Year and Date
      2014-11-21
    • Invited
    • Data Source
      KAKENHI-PUBLICLY-25106503
  • [Presentation] Energy Optimization in Speed Scaling Models via Submodular Optimization2014

    • Author(s)
      塩浦昭義
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      崇城大学(熊本県熊本市)
    • Year and Date
      2014-12-05
    • Data Source
      KAKENHI-PROJECT-24500002
  • [Presentation] Computing a Walrasian equilibrium in iterative auctions with multiple differentiated items2014

    • Author(s)
      Akiyoshi Shioura
    • Organizer
      Japanese-Swiss Workshop on Combinatorics and Computational Geometry
    • Place of Presentation
      東京大学(東京都文京区)
    • Year and Date
      2014-06-05
    • Invited
    • Data Source
      KAKENHI-PUBLICLY-25106503
  • [Presentation] Computing a Walrasian equilibrium in iterative auctions with multiple differentiated items2013

    • Author(s)
      K. Murota, A. Shioura, and Z. Yang
    • Organizer
      The 24th International Symposium on Algorithms and Computation (ISAAC 2013)
    • Place of Presentation
      Hong Kong, Hong Kong Special Administrative Region of the People’s Republic of China
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Presentation] Dijkstra's algorithm viewed from discrete convex analysis2013

    • Author(s)
      K. Murota and A. Shioura
    • Organizer
      The 8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications
    • Place of Presentation
      Veszprem, Hungary
    • Invited
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Presentation] Computing the Convex Closure of Discrete Convex Functions2012

    • Author(s)
      Akiyoshi Shioura
    • Organizer
      21st International Symposium on Mathematical Programming
    • Place of Presentation
      TU Berlin (Berlin, Germany)
    • Data Source
      KAKENHI-PROJECT-24500002
  • [Presentation] Computing the Convex Closure of Discrete Convex Functions2012

    • Author(s)
      A. Shioura
    • Organizer
      Workshop on Modern Aspects of Submodularity
    • Place of Presentation
      アトランタ, アメリカ
    • Year and Date
      2012-03-20
    • Data Source
      KAKENHI-PROJECT-21740060
  • [Presentation] Computing the convex closure of discrete convex functions2012

    • Author(s)
      Akiyoshi Shioura
    • Organizer
      Workshop on Modern Aspects of Submodularity
    • Place of Presentation
      Georgia Institutes of Technology (Atlanta, USA)
    • Invited
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Presentation] ダイクストラ法と離散凸解析2012

    • Author(s)
      室田一雄,塩浦昭義
    • Organizer
      日本オペレーションズ・リサーチ学会2012年秋季研究発表会
    • Place of Presentation
      ウインクあいち(愛知県名古屋市)
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Presentation] Computing the Convex Closure of Discrete Convex Functions2012

    • Author(s)
      Akiyoshi Shioura
    • Organizer
      Workshop on Modern Aspects of Submodularity
    • Place of Presentation
      アトランタ,アメリカ(招待講演)
    • Year and Date
      2012-03-20
    • Data Source
      KAKENHI-PROJECT-21740060
  • [Presentation] Minimization Algorithms for Discrete Convex Functions2012

    • Author(s)
      Akiyoshi Shioura
    • Organizer
      RIMS Workshop on Discrete Convexity and Optimization
    • Place of Presentation
      京都大学数理解析研究所 (京都市左京区)
    • Invited
    • Data Source
      KAKENHI-PROJECT-24500002
  • [Presentation] Optimal allocation in combinatorial auctions with quadratic utility functions2011

    • Author(s)
      A.Shioura, S.Suzuki
    • Organizer
      8th Annual Conference on Theory and Applications of Models of Computation (TAMC 2011)
    • Place of Presentation
      電気通信大学(東京都)
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Presentation] Polynomial-time approximation scheme for maximizing M#-concave functions under budget constraints2011

    • Author(s)
      Akiyoshi Shioura
    • Organizer
      7th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications
    • Place of Presentation
      京都大学数理解析研究所 (京都市左京区)
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Presentation] Polynomial-Time Approximation Scheme for Maximizing M〓-concave Functions under Budget Constraints2011

    • Author(s)
      Akiyoshi Shioura
    • Organizer
      7th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications
    • Place of Presentation
      京都大学
    • Year and Date
      2011-06-01
    • Data Source
      KAKENHI-PROJECT-21740060
  • [Presentation] Polynomial-Time Approximation Scheme for Maximizing Gross Substitutes Utility under Budget Constraints2011

    • Author(s)
      A. Shioura
    • Organizer
      NII Shonan Meeting on Graph Algorithms and Combinatorial Optimization
    • Place of Presentation
      湘南国際村センター(神奈川県葉山町)
    • Year and Date
      2011-02-15
    • Data Source
      KAKENHI-PROJECT-21740060
  • [Presentation] Polynomial-Time Approximation Scheme for Maximizing Gross Substitutes Utility under Budget Constraints2011

    • Author(s)
      Akiyoshi Shioura
    • Organizer
      19th Annual European Symposium on Algorithms (ESA 2011)
    • Place of Presentation
      ザールブリュッケン,ドイツ
    • Year and Date
      2011-09-05
    • Data Source
      KAKENHI-PROJECT-21740060
  • [Presentation] Polynomial-Time Approximation Scheme for Maximizing Gross Substitutes Utility under Budget Constraints2011

    • Author(s)
      A. Shioura
    • Organizer
      19th Annual European Symposium on Algorithms(ESA 2011)
    • Place of Presentation
      ザールブリュッケン, ドイツ
    • Year and Date
      2011-09-05
    • Data Source
      KAKENHI-PROJECT-21740060
  • [Presentation] Polynomial-Time Approximation Scheme for Maximizing M.-concave Functions under Budget Constraints2011

    • Author(s)
      A. Shioura
    • Organizer
      7th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications
    • Place of Presentation
      京都大学
    • Year and Date
      2011-06-01
    • Data Source
      KAKENHI-PROJECT-21740060
  • [Presentation] Overview of discrete convex analysis2011

    • Author(s)
      A.Shioura
    • Organizer
      19th Triennial Conference of the International Federation of Operational Research Societies (IFORS 2011)
    • Place of Presentation
      Melbourne, Australia
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Presentation] Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra2010

    • Author(s)
      A. Shioura
    • Organizer
      International Symposium on Algorithms and Computation (ISAAC)2010
    • Place of Presentation
      ラマダプラザ済州ホテル(大韓民国済州島)
    • Year and Date
      2010-12-15
    • Data Source
      KAKENHI-PROJECT-21740060
  • [Presentation] Neighbor systems, jump systems, and bisubmodular polyhedra2010

    • Author(s)
      A.Shioura
    • Organizer
      International Symposium on Algorithms and Computation (ISAAC) 2010
    • Place of Presentation
      Jeju, South Korea
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Presentation] Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra2010

    • Author(s)
      塩浦昭義
    • Organizer
      研究集会「最適化:モデリングとアルゴリズム
    • Place of Presentation
      統計数理研究所(東京都立川市)
    • Year and Date
      2010-03-24
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Presentation] Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra2010

    • Author(s)
      Akiyoshi Shioura
    • Organizer
      International Symposium on Algorithms and Computation (ISAAC) 2010
    • Place of Presentation
      ラマダプラザ済州ホテル(大韓民国済州島)
    • Year and Date
      2010-12-15
    • Data Source
      KAKENHI-PROJECT-21740060
  • [Presentation] A Divide-and-Conquer Approach for Polymatroid Optimization with Application to Preemptive Scheduling Problems2009

    • Author(s)
      N.Shakhlevich, A.Shioura, V.Strusevich
    • Organizer
      6th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications
    • Place of Presentation
      Budapest, Hungary
    • Year and Date
      2009-05-17
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Presentation] A Decomposition Algorithm for Linear Optimization Over Polymatroids with Applications2009

    • Author(s)
      N. Shakhlevich, A. Shioura, V. Strusevich
    • Organizer
      20th International Symposium on Mathematical Programming
    • Place of Presentation
      シカゴ, アメリカ
    • Year and Date
      2009-08-25
    • Data Source
      KAKENHI-PROJECT-21740060
  • [Presentation] 2次の効用関数に関する不可分財の最適配分問題の計算量について2009

    • Author(s)
      塩浦昭義, 吉田卓司
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      京都大学数理解析研究所(京都府京都市)
    • Year and Date
      2009-04-17
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Presentation] A Fast Divide-and-Conquer Algorithm for Polymatroid Optimization and Its Application to Preemptive Scheduling Problems with Controllable Processing Times2009

    • Author(s)
      塩浦昭義
    • Organizer
      統計数理研究所研究集会「最適化:モデリングとアルゴリズム」
    • Place of Presentation
      統計数理研究所
    • Year and Date
      2009-03-25
    • Data Source
      KAKENHI-PROJECT-18740042
  • [Presentation] A Decomposition Algorithm for Linear Optimization Over Polym atroids with Applications2009

    • Author(s)
      N.Shakhlevich, A.Shioura, V.Strusevich
    • Organizer
      The 20th International Symposium on Mathematical Programming
    • Place of Presentation
      Chicago, USA
    • Year and Date
      2009-08-25
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Presentation] A divide-and-conquer approach for polymatroid optimization with application to preemptive scheduling problems2009

    • Author(s)
      Natalia Shakhlevich, Akiyoshi Shioura, Vitaly Strusevich
    • Organizer
      6th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications
    • Place of Presentation
      ブダペスト, ハンガリー
    • Year and Date
      2009-05-09
    • Data Source
      KAKENHI-PROJECT-21740060
  • [Presentation] A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions2009

    • Author(s)
      A.Shioura, M.Yagiura
    • Organizer
      15th International Computing and Combinatorics Conference (COCOON2009)
    • Place of Presentation
      Niagara Falls, USA
    • Year and Date
      2009-07-13
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Presentation] A Divide-and-Conquer Approach for Polymatroid Optimization with Application to Preemptive Scheduling Problems2009

    • Author(s)
      N. Shakhlevich, A. Shioura, V. Strusevich
    • Organizer
      6th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications
    • Place of Presentation
      ブダペスト, ハンガリー
    • Year and Date
      2009-05-09
    • Data Source
      KAKENHI-PROJECT-21740060
  • [Presentation] Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problem s with Controllable Processing Times : A Polymatroid Optimization Approach2008

    • Author(s)
      塩浦昭義
    • Organizer
      16th European Symposium on Algorithms
    • Place of Presentation
      ドイツ, カールスルー工大学
    • Year and Date
      2008-09-17
    • Data Source
      KAKENHI-PROJECT-18740042
  • [Presentation] On the Pipage Rounding Algorithm for Submodular Function Maximization -A View from Discrete Convex Analysis-2008

    • Author(s)
      塩浦昭義
    • Organizer
      統計数理研究所研究集会「最適化:モデリングとアルゴリズム」
    • Place of Presentation
      統計数理研究所
    • Year and Date
      2008-03-18
    • Data Source
      KAKENHI-PROJECT-18740042
  • [Presentation] 劣モジュラ関数最大化に対する近似アルゴリズムと離散凹性2008

    • Author(s)
      塩浦昭義
    • Organizer
      応用数理学会春の研究部会連合発表会
    • Place of Presentation
      首都大学東京
    • Year and Date
      2008-03-09
    • Data Source
      KAKENHI-PROJECT-18740042
  • [Presentation] Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times: A Polymatroid Optimization Approach2008

    • Author(s)
      塩浦昭義
    • Organizer
      16th European Symposium on Algorithms
    • Place of Presentation
      ドイツ,カールスルーエ大学
    • Year and Date
      2008-09-17
    • Data Source
      KAKENHI-PROJECT-18740042
  • [Presentation] On the Pipage Rounding Algorithm for Submodular Function Maximization: A View from Discrete Convex Analysis2008

    • Author(s)
      塩浦昭義
    • Organizer
      統計数理研究所研究集会「最適化:モデリングとアルゴリズム」
    • Place of Presentation
      統計数理研究所
    • Year and Date
      2008-03-18
    • Data Source
      KAKENHI-PROJECT-18740042
  • [Presentation] Divide-and-Conquer Approach for Preemptive Scheduling Problems with Controllable Processing Times2008

    • Author(s)
      塩浦昭義
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      東北大学
    • Year and Date
      2008-10-10
    • Data Source
      KAKENHI-PROJECT-18740042
  • [Presentation] Divide-and-Conquer Approach for Preemptive Scheduling ,Problems with Controllable Processing Times2008

    • Author(s)
      塩浦昭義
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      東北大学
    • Year and Date
      2008-10-10
    • Data Source
      KAKENHI-PROJECT-18740042
  • [Presentation] 最小費用テンション問題に対する算法と画像処理への応用2007

    • Author(s)
      塩浦昭義
    • Organizer
      日本オペレーションズリサーチ学会2007年秋季研究発表会
    • Place of Presentation
      政策研究大学院大学
    • Year and Date
      2007-09-27
    • Data Source
      KAKENHI-PROJECT-18740042
  • [Presentation] 凸費用ネットワークフロー問題の双対に対する効率的なアルゴリズムと そのコンピュータビジョンへの応用2007

    • Author(s)
      塩浦昭義
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      新潟大学
    • Year and Date
      2007-11-30
    • Data Source
      KAKENHI-PROJECT-18740042
  • [Presentation] アメリカン・アジアンオプションの価格の近似に対する計算幾何学的アプローチ2007

    • Author(s)
      塩浦 昭義
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      岩手大学
    • Year and Date
      2007-05-11
    • Data Source
      KAKENHI-PROJECT-18740042
  • [Presentation] 凸費用ネットワークフロー問題の双対に対する効率的なアルゴリズムとそのコンピュータビジョンへの応用2007

    • Author(s)
      Vladimir Kolmogorov, 塩浦昭義
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      新潟大学
    • Year and Date
      2007-11-30
    • Data Source
      KAKENHI-PROJECT-18740042
  • [Presentation] Polynomial-Time Algorithms for Convex Optimization on Jump Systems2007

    • Author(s)
      塩浦昭義
    • Organizer
      Workshop on Advances in Optimization
    • Place of Presentation
      東京工業大学
    • Year and Date
      2007-04-20
    • Data Source
      KAKENHI-PROJECT-18740042
  • [Presentation] ジャンプシステム上の最適化問題に対するアルゴリズム2007

    • Author(s)
      塩浦昭義
    • Organizer
      日本オペレーションズ・リサーチ学会計算と最適化研究部会
    • Place of Presentation
      上智大学
    • Year and Date
      2007-04-14
    • Data Source
      KAKENHI-PROJECT-18740042
  • [Presentation] Computing a Walrasian equilibrium in iterative auctions with multiple differentiated items

    • Author(s)
      Kazuo, Murota, Akiyoshi Shioura, Zaifu Yang
    • Organizer
      24th International Symposium on Algorithms and Computation (ISAAC 2013)
    • Place of Presentation
      University of Hong Kong (Hong Kong)
    • Data Source
      KAKENHI-PUBLICLY-25106503
  • [Presentation] ワルラス均衡の計算に対する反復オークションの計算量解析:離散凸解析による アプローチ

    • Author(s)
      室田一雄,塩浦昭義, Zaifu Yang
    • Organizer
      研究集会「最適化:モデリングとアルゴリズム」
    • Place of Presentation
      政策研究大学院大学(東京都港区)
    • Data Source
      KAKENHI-PUBLICLY-25106503
  • [Presentation] Dijkstra algorithm viewed from discrete convex analysis

    • Author(s)
      Kazuo Murota, Akiyoshi Shioura
    • Organizer
      8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications
    • Place of Presentation
      Pannon University (Veszprem, Hungary)
    • Invited
    • Data Source
      KAKENHI-PROJECT-24500002
  • [Presentation] ダイクストラ法と離散凸関数最小化

    • Author(s)
      室田一雄,塩浦昭義
    • Organizer
      研究集会「最適化:モデリングとアルゴリズム」
    • Place of Presentation
      統計数理研究所(東京都立川市)
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Presentation] 複数財の競り上げ式オークションにおけるワルラス均衡の計算:離散凸解析に基づく計算量解析

    • Author(s)
      塩浦昭義
    • Organizer
      OR横断若手の会
    • Place of Presentation
      京都大学(京都市左京区)
    • Invited
    • Data Source
      KAKENHI-PUBLICLY-25106503
  • [Presentation] L凸関数の最小化:離散凸解析から広がる世界

    • Author(s)
      塩浦昭義
    • Organizer
      研究集会「最適化の理論と応用 -- 未来を担う若手研究者の集い2013 --
    • Place of Presentation
      筑波大学(茨城県つくば市)
    • Invited
    • Data Source
      KAKENHI-PROJECT-24500002
  • [Presentation] Dijkstra algorithm viewed from discrete convex analysis (離散凸解析から見たDijkstra法)

    • Author(s)
      室田一雄,塩浦昭義
    • Organizer
      電子情報通信学会技術研究報告 IEICE Technical Report (Theoretical Foundations of Computing) COMP2012-10
    • Place of Presentation
      愛媛大学(愛媛県松山市)
    • Data Source
      KAKENHI-PROJECT-21360045
  • 1.  MUROTA Kazuo (50134466)
    # of Collaborated Projects: 9 results
    # of Collaborated Products: 22 results
  • 2.  TAMURA Akihisa (50217189)
    # of Collaborated Projects: 6 results
    # of Collaborated Products: 2 results
  • 3.  TSUCHIMURA Nobuyuki (20345119)
    # of Collaborated Projects: 4 results
    # of Collaborated Products: 1 results
  • 4.  FURIHATA Daisuke (80242014)
    # of Collaborated Projects: 3 results
    # of Collaborated Products: 0 results
  • 5.  MORIGUCHI Satoko (60407351)
    # of Collaborated Projects: 3 results
    # of Collaborated Products: 2 results
  • 6.  MATUURA Shiro (00332619)
    # of Collaborated Projects: 3 results
    # of Collaborated Products: 0 results
  • 7.  IWATA Satoru (00263161)
    # of Collaborated Projects: 3 results
    # of Collaborated Products: 0 results
  • 8.  KAKIMURA Naonori (30508180)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 9.  KOBAYASHI Yusuke (40581591)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 10.  FUJIE Tetsuya (40305678)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 11.  MATSUI Tomomi (30270888)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 12.  徳山 豪 (40312631)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 1 results
  • 13.  河原林 健一 (40361159)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 14.  全 眞嬉 (80431550)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 15.  BAFFIER JEAN-FRANCOIS
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results

URL: 

Are you sure that you want to link your ORCID iD to your KAKEN Researcher profile?
* This action can be performed only by the researcher himself/herself who is listed on the KAKEN Researcher’s page. Are you sure that this KAKEN Researcher’s page is your page?

この研究者とORCID iDの連携を行いますか?
※ この処理は、研究者本人だけが実行できます。

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi