Discrete Convex Optimization Solvers and Demonstration Softwares

Bibliographic Information

Other Title
  • 離散凸最適化ソルバとデモンストレーションソフトウェア
  • リサン トツ サイテキ カ ソルバ ト デモンストレーション ソフトウェア

Search this article

Abstract

In the last decade, efficient discrete optimization algorithms have been proposed in discrete convex analysis, which is a unified framework of discrete convex optimization based on the theory of matroids and submodular functions. With a view to disseminating these theoretical results in application fields, we have developed softwares and web applications of fundamental algorithms for discrete convex minimization.

Journal

Citations (1)*help

See more

References(21)*help

See more

Related Projects

See more

Details 詳細情報について

Report a problem

Back to top