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

2001 Fiscal Year Final Research Report Summary

Discrete Optimization Algorithms based on Discrete Convex Analysis

Research Project

Project/Area Number 10205212
Research Category

Grant-in-Aid for Scientific Research on Priority Areas (B)

Allocation TypeSingle-year Grants
Research InstitutionKyoto University

Principal Investigator

MUROTA Kazuo  Kyoto University, Research Institute for Mathematical Sciences, Professor, 数理解析研究所, 教授 (50134466)

Co-Investigator(Kenkyū-buntansha) TAMURA Akihisa  Kyoto University, Research Institute for Mathematical Sciences, Associate Professor, 数理解析研究所, 助教授 (50217189)
FURIHATA Daisuke  Kyoto University, Research Institute for Mathematical Sciences, Research Associate, 数理解析研究所, 助手 (80242014)
SHIOURA Akiyoshi  Sophia University, Faculty of Science and Technology, Assistant, 理工学部, 助手 (10296882)
FUJIE Tetsuya  Kobe University of Commerce, Dept. of Management Science, Research Assistant, 管理科学科, 助手 (40305678)
Project Period (FY) 1998 – 2000
Keywordsdiscrete optimization / convex analysis / convex function / matroid / combinatorial optimization / submodular function / convex set / base polyhedron
Research Abstract

In the area of nonlinear programming, the theory of convex analysis provides a unified framework for well-solved problems. In the area of discrete optimization, on the other hand, we do not have such a unified framework. Matroidal structure, however, is known to be a well-behaved structure in discrete optimization. The theory of "discrete convex analysis" is proposed by the head investigator with a view to capturing the continuous optimization and the discrete optimization from a common viewpoint. Discrete convex analysis is a theoretical framework connecting the theory of convex analysis and the theory of matroids.
It is often the case that discrete optimization problems appearing in the real world do not have nice combinatorial structure such as matroids. Therefore, we need to use enumeration-type algorithms such as the branch-and-bound method or approximation algorithms such as meta heuristics. In either approach, it is essential to extract tractable part from the discrete structure … More of the problems to be solved. For example, it is often effective to extract network-like structure as subproblems when we solve general discrete optimization problems.
The fundamental idea of our research is to extract certain structure which can be dealt with discrete convex analysis as subproblems when we solve general discrete optimization problems. We summarize the main results as follows :
・The concepts of M-convex and L-convex functions play a central role in the framework of discrete convex analysis. We showed various properties of these functions.
・We proposed efficient algorithms for the minimization of M-convex functions.
・We extended the concepts of M-convex and L-convex functions defined over the integer lattice to functions over the real space.
・We generalized the concepts of M-convex and L-convex functions to quasi M-convex/L-convex functions.
・We obtained some results on the application of discrete convex analysis to economic equilibrium such as the equivalence of gross substitutes property and M-convexity. Less

  • Research Products

    (14 results)

All Other

All Publications (14 results)

  • [Publications] Murota, K., Shioura, A.: "Extension of M-convexity and L-convexity to Polyhedral Convex Functions"Advances in Applied Mathematics. 25. 352-427 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Murota, K., Shioura, A.: "Relationship of M-/L-convex Functions with Discrete Convex Functions by Miller and by Favati-Tardella"Discrete Applied Mathematics. 115. 151-176 (2001)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Murota, K., Tamura, A.: "New Characterizations of M-convex Functions and Their Applications to Economic Equilibrium Models"Discrete Applied Mathematics. (to appear). (2002)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Furihata, D.: "A Stable and Conservative Finite Difference Scheme for the Cahn-Hilliard Equation"Numerische Mathematik. 87. 675-699 (2001)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Shinano, Y., Fujie, T.: "Parallel Branch-and-Bound Algorithms on a PC Cluster using PUBB"Proc.of World Multiconference on Systemics,Cybernetics and Informatics. 3. 328-333 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] McCormick, S.T., Shioura, A.: "Minimum Ratio Canceling is Oracle Polynomial for Linear Programming,but Not Strongly Polynomial,Even for Networks"Operations Research Letters. 27. 199-207 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 室田 一雄: "離散凸解析"共立出版. 308 (2001)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Murota, K., Shioura, A.: "Extension of M-convexity and L-convexity to Polyhedral Convex Functions"Advances in Applied Mathematics. 25. 352-427 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Murota, K., Shioura, A.: "Relationship of M-/L-convex Functions with Discrete Convex Functions by Miller and by Favati-Tardella"Discrete Applied Mathematics. 115. 151-176 (2002)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Murota, K., Tamura, A.: "New Characterizations of M-convex Functions and Their Applications to Economic Equilibrium Models"Discrete Applied Mathematics. (to appear). (2002)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Furihata, D.: "A Stable and Conservative Finite Difference Scheme for the Cahn-Hilliard Equation"Numerische Mathematik. 87. 675-699 (2001)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Shinano. Y., Fujie, T.: "Parallel Branch-and-Bound Algorithms on a PC Cluster using PUBB"Proc. of World Multiconference on Systemics, Cybernetics and Informatics. 3. 328-333 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] McCormick, S. T., Shioura, A.: "Minimum Ratio Canceling is Oracle Polynomial for Linear Programming, but Not Strongly Polynomial, Even for Networks"Operations Research Letters. 27. 199-207 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Murota, K.: "Discrete Convex Analysis - An Introduction"Kyoritsu Publishing Co.. (2001)

    • Description
      「研究成果報告書概要(欧文)」より

URL: 

Published: 2003-09-17  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi