Algorithms in Discrete Convex Analysis(Special Issue on Algorithm Engineering : Surveys)

スポンサーリンク

概要

• 論文の詳細を見る

• This is a survey of algorithmic results in the theory of "discrete convex analysis"for integer-valued functions defined on integer lattice points. The theory parallels the ordinary convex analysis, covering discrete analogues of the fundamental concepts such as conjugacy, the Fenchel min-max duality, and separation theorems. The technical development is based on matroid-theoretic concepts, in particular, submodular functions and exchange axioms.

• 社団法人電子情報通信学会の論文
• 2000-03-25

著者

• Murota Kazuo

  Research Institute For Mathematical Science Kyoto University

関連論文

• CHARACTERIZING A VALUATED DELTA-MATROID AS A FAMILY OF DELTA-MATROIDS*
• Algorithms in Discrete Convex Analysis(Special Issue on Algorithm Engineering : Surveys)
• Comparison of Conventional and "Invariant" Schemes of Fundamental Solutions Method for Annular Domains
• A Remark Symmetries in Linear Control Systems
• Fault-Tolerance of Control Systems with Dihedral Group Symmetry

スポンサーリンク