Published Papers
Refereed Publications

• ``Note on the polyhedral description of the Minkowski sum of two L-convex sets,''
  Satoko Moriguchi, Kazuo Murota,
  Japan Journal of Industrial and Applied Mathematics, June (2022)
  DOI: https://doi.org/10.1007/s13160-022-00512-3

• ``Conic relaxation approaches for equal deployment problems,''
  Sena Safarina, Tim J. Mullin, Satoko Moriguchi, and Makoto Yamashita,
  Discrete Applied Mathematics, 275, March (2020), 111-125.
  DOI: https://doi.org/10.1016/j.dam.2019.04.032

• ``Discrete Midpoint Convexity,''
  Satoko Moriguchi, Kazuo Murota, Akihisa Tamura, and Fabio Tardella,
  Mathematics of Operations Research, Vol. 45 (2020), No.1, pp.99-128.
  DOI: https://doi.org/10.1287/moor.2018.0984

• ``Projection and Convolution Operations for Integrally Convex Functions,''
  Satoko Moriguchi, Kazuo Murota,
  Discrete Applied Mathematics, 255, February (2019), 283-298
  DOI: https://doi.org/10.1016/j.dam.2018.08.010

• ``On Fundamental Operations for Multimodular Functions,''
  Satoko Moriguchi, Kazuo Murota,
  Journal of the Operations Research Society of Japan, 62, No.2, April (2019), 53-63
  [Errata]

• ``IT project scheduling based on a multi-objective genetic algorithm,''
  Takaaki Kobayashi, Satoko Moriguchi
  The Information Processing Society of Japan, Transactions on Mathematical Modeling and its Applications Vol. 11, No.3 (2018), 42-57. (in Japanese)

• ``Scaling, Proximity, and Optimization of Integrally Convex Functions,''
  Satoko Moriguchi, Kazuo Murota, Akihisa Tamura, Fabio Tardella,
  Mathematical Programming, May (2019), Volume 175, Issue 1-2, pp 119-154.
  DOI :10.1007/s10107-018-1234-z. ( Electronic publication is also available. First Online: 24 January 2018)

• ``Scaling and proximity properties of integrally convex functions,''
  S. Moriguchi, K. Murota, A. Tamura, and F. Tardella,
  27th International Symposium on Algorithms and Computation (ISAAC 2016), Seok-Hee Hong (Ed.): ISAAC2016, Leibniz International Proceedings in Informatics (LIPIcs), Vol.64 (2016), Article No. 57, pp.57:1--57:12. DOI: 10.4230/LIPIcs.ISAAC.2016.0

• ``Discrete convex optimization solvers and demonstration softwares, ''
  Nobuyuki TSUCHIMURA, Satoko MORIGUCHI, and Kazuo MUROTA,
  Transactions of the Japan Society for Industrial and Applied Mathematics, Vol. 23, No.2 (2013), 233-252 (in Japanese)

• ``On Discrete Hessian Matrix and Convex Extensibility,''
  Satoko MORIGUCHI and Kazuo MUROTA,
  Journal of the Operations Research Society of Japan, 55 (2012), 48-62

• ``M-convex Function Minimization by Continuous Relaxation Approach ---Proximity Theorem and Algorithm--- ,''
  Satoko MORIGUCHI, Akiyoshi SHIOURA, and Nobuyuki TSUCHIMURA,
  SIAM Journal on Optimization, 21 (3) (2011), 633-668

• ``Discrete L-Convex Functions Minimization Based on Continuous Relaxation ,''
  Satoko MORIGUCHI and Nobuyuki TSUCHIMURA,
  Pacific Journal of Optimization, Vol. 5 (2009), 227-236

• ``On Continuous/Discrete Hybrid M-Convex Functions ,'' with Shinji HARA and Kazuo MUROTA

  Transactions of the Institute of Systems, Control and Information Engineers , Vol. 20 (2007), 84-86 (in Japanese)

• ``Discrete Hessian Matrix for L-convex Functions,'' with Kazuo MUROTA

  IEICE Transactions on Fundamentals, E88-A (2005), 1104-1108

  (Mathematical Engineering Technical Reports METR 2004-30, University of Tokyo (2004)).

• ``The Resource Allocation Problem with Feedback,'' with T. Ichimori

  Transactions of the Operations Research Society of Japan , Vol. 48 (2005), 1-11 (in Japanese)

• ``Capacity Scaling Algorithm for M-Convex Submodular Flow,'' with Satoru IWATA and Kazuo MUROTA.

  Mathematical Programming, Vol.103 (2005), No.1 (May), 181--202.

  (Electronic publication is also available.)

  (In: D. Bienstoc, G. Nemhauser (eds.): Integer Programming and Combinatorial Optimization, LNCS 3064, Springer-Verlag (2004) 352--367.)

  (Mathematical Engineering Technical Reports METR 2003-42, University of Tokyo (2003).)

• ``On Hochbaum's Proximity-Scaling Algorithm for the General Resource Allocation Problem,'' with Akiyoshi SHIOURA

  Mathematics of Operations Research , 29 (2004) 394-397..

  (Research Report on Department of Mathematical and Computing Sciences B-377, Tokyo Institute of Technology (January, 2002).)

• ``Capacity Scaling Algorithm for Scalable M-convex Submodular Flow Problems,'' with Kazuo MUROTA

  Optimization Method and Software Vol.18, No. 2 (2003) 207-218.

• ``Scaling Algorithms for M-convex Function Minimization,'' with Kazuo MUROTA and Akiyoshi SHIOURA

  IEICE Transactions on Fundamentals E85-A (2002) 922-929.
  

• ``Scaling Approach to Optimization Algorithms for Discrete Convex Functions,''

  Doctor Thesis, Tokyo Institute of Technology, March, 2004.

Techninal Reports

• ``Inclusion and Intersection Relations Between Fundamental Classes of Discrete Convex Functions,''
  Satoko Moriguchi, Kazuo Murota,
  (November, 2021).
  arXiv:2111.07240

• ``Note on the Polyhedral Description of the Minkowski Sum of Two L-convex Sets,''
  Satoko Moriguchi, Kazuo Murota,
  (October, 2021).
  arXiv:2110.10445

• ``Projection and Convolution Operations for Integrally Convex Functions,''
  Satoko Moriguchi, Kazuo Murota,
  (Octber, 2017).
  arxiv:1710.04077

• ``Discrete Midpoint Convexity,''
  Satoko Moriguchi, Kazuo Murota, Akihisa Tamura, Fabio Tardella,
  (August, 2017).
  arxiv:1708.04579

• ``Scaling, Proximity, and Optimization of Integrally Convex Functions,''
  Satoko Moriguchi, Kazuo Murota, Akihisa Tamura, Fabio Tardella,
  (March, 2017).
  arxiv:1703.10705

• ``Conic relaxation approaches for equal deployment problems,''
  Sena Safarina, Tim J. Mullin, Satokoro Moriguchi, and Makoto Yamashita,
  Research Report B-485, Dept. of Mathematical and Computing Science, Tokyo Institute of Technology, Tokyo, Japan, (March, 2017).
  arxiv:1703.03155
  optimization-online

• ``Constructing a Nonconvex Discrete Function with Positive Semidefinite Discrete Hessian Matrix,''
  Satoko MORIGUCHI and Kazuo MUROTA,
  Mathematical Engineering Technical Reports METR 2011-36, University of Tokyo (2011).

• ``Note on Discrete Hessian Matrix and Convex Extensibility,''
  Satoko MORIGUCHI and Kazuo MUROTA,
  Mathematical Engineering Technical Reports METR 2011-27, University of Tokyo (2011).

• ``M-convex Function Minimization by Continuous Relaxation Approach -- Proximity Theorem and Algorithm --,''
  Satoko MORIGUCHI, Akiyoshi SHIOURA, and Nobuyuki TSUCHIMURA,
  Mathematical Engineering Technical Reports METR 2008-38, University of Tokyo (2008).

• ``Discrete Hessian Matrix for L-convex Functions,''
  Satoko Moriguchi and Kazuo MUROTA,
  Mathematical Engineering Technical Reports METR 2004-30, University of Tokyo (2004).

• ``Capacity Scaling Algorithm for M-Convex Submodular Flow,''
  Satoru IWATA, Satoko Moriguchi, and Kazuo MUROTA,
  Mathematical Engineering Technical Reports METR 2003-42, University of Tokyo (2003).

• ``On Hochbaum's Scaling Algorithm for the General Resource Allocation Problem,''
  Satoko Moriguchi and Akiyoshi SHIOURA,
  Research Report on Department of Mathematical and Computing Sciences B-377, Tokyo Institute of Technology (January, 2002).

• S. Moriguchi and M. Honda, ``Office Workplace Management with Social Distancing by Mathematical Optimization ,''

  36th National Conference of The Society of Project Management, Online, March 11-12, 2021

• S. Moriguchi, A. Tamura, F. Tardella, and K. Murota, ``Scaling, proximity, and optimization of integrally convex functions,''

  ISMP2018 (The 23rd International Symposium on Mathematical Programming), Bordeaux, France, July 1-6, 2018

• F. Tardella, K. Murota, A. Tamura, and S. Moriguchi, `` Discrete Midpoint Convexity,''

  ISMP2018 (The 23rd International Symposium on Mathematical Programming), Bordeaux, France, July 1-6, 2018

• S. Moriguchi, K. Murota, A. Tamura, and F. Tardella, ``Scaling and Proximity Properties of Integrally Convex Functions,''

  ISAAC2016 (The 27th International Symposium on Algorithms and Computation), Sydney, Australia, December 12-14, 2016 accepted!

• Satoko Moriguchi, `` Discrete Convex Analysis and Inventory Systems, ''

  International Symposium on Mathematics of Logistics: Theory and Practices, Tokyo University of Marine Science and Technology, November 2011.

• Takeyuki Nagao, Yosuke Tsuchiya, and Satoko Moriguchi, ``VideoPacker: An On-Demand Learning Material Exporting System for Video Lectures,''

  Annual International Conference onEducation & e-Learning EeL 2011, Singapore, November 7-8, 2011.

• Satoko Moriguchi, ``Discrete Convex Analysis Approach for Inventory Models,''

  International Symposium of Case Studies involving Statistics and Operations Research for Decision Making: Solving Human Problems in Business, Society, and Scientific Areas, Institute of Statistical Mathematics, Tokyo, 2nd March 2009.

• Satoko Moriguchi and Nobuyuki TSUCHIMURA, ``Minimization of a Discrete Quasi L-convex Function Based on Continuous Relaxation,''

  The 4th Sino-Japanese Optimization Meeting (SJOM2008), National Cheng-Kung University, Tainan, Taiwan, during August 27-31, 2008.

• Satoko Moriguchi and Nobuyuki TSUCHIMURA, ``Discrete Convex Functions Minimization Based on Continuous Relaxation,''

  Ninth International Conference Approximation and Optimization in the Caribbean - APPOPT’2008, San Andres, Colombia, during March 2-7, 2008.

• Satoru IWATA, Satoko MORIGUCHI, Kazuo MUROTA, ``A Capacity Scaling Algorithm for M-Convex Submodular Flow,''

  IPCO (Integer Programming and Combinatorial Optimization) X, Columbia University, New York City, USA, June, 2004

• Satoko MORIGUCHI, Kazuo MUROTA, ``Capacity Scaling Algorithm for Scalable M-convex Submodular Flows,''

  The 18th International Symposium on Mathematical Programming , Technical University of Denmark, Copenhagen, Denmark, Aug., 2003

• Satoko MORIGUCHI, Kazuo MUROTA, ``Algorithms for Submodular Flows with an M-convex Function,''

  The 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, The University of Tokyo, Tokyo, Japan, Jan., 2003

• Satoko MORIGUCHI, ``Algorithms for M-convex Submodular Flow Problems,''

  The Second Japanese-Sino Optimization Meeting, RIHGA Royal Hotel Kyoto, Kyoto, Japan, Sep., 2002

• Satoko MORIGUCHI, ``Algorithms for M-convex Submodular Flow Problems,''

  Workshop on Nonconvex Optimization, The University of Tokyo, Tokyo, Japan, Sep., 2002

• Satoko MORIGUCHI, Kazuo MUROTA, Akiyoshi SHIOURA, ``Scaling algorithms for M-convex function minimization,''

  Optimization Workshop at Tokyo Institute of Technology, Tokyo Institute of Technology, Tokyo, Japan, Jun. 2001

Published Book

• T. Araki and S. Moriguchi, “Text book for Japan Information-Technology Engineers Examination for Technical Engineer (Network),”

  Zeimukeiri Kyokai Co., LTD., (2001) (in Japanese)

Acquired external funds

• 2021/04/01 - 2025/03/31 Grants-in-Aid for Scientific Research (C) 21K04533 by the Ministry of Education, Culture, Sports, Science and Technology in Japan
  ”Discrete convex approximation on non-linear discrete optimization”
• 2017/04/01 - 2022/03/31 Grants-in-Aid for Scientific Research (C) 17K00037 by the Ministry of Education, Culture, Sports, Science and Technology in Japan
  ”Scaling and proximity properties of discrete optimization”
• 2014/04/01 - 2018/03/31 Grants-in-Aid for Scientific Research (C) 22710148 by the Ministry of Education, Culture, Sports, Science and Technology in Japan
  ”Scheduling under uncertainty and multi-information based on discrete convex analysis”
• 2010/04/01 - 2014/03/31 Grants-in-Aid for Scientific Research, Grant for Young Scientists (B) 22710148 by the Ministry of Education, Culture, Sports, Science and Technology in Japan
  ”Advanced inventory systems based on discrete convex analysis”
• 2006/04/01 - 2009-03/31 Grants-in-Aid for Scientific Research, Grant for Young Scientists (B) 18710137 by the Ministry of Education, Culture, Sports, Science and Technology in Japan
  ”Optimization algorithms based on discrete convex structures and the application to CRM”