The Linear Complementarity Problem on Oriented Matroids(Special Issue on Algorithm Engineering : Surveys)

スポンサーリンク

概要

• 論文の詳細を見る

• The linear complementarity problem(LCP)is one of the most widely studied mathematical programming problems. The theory of LCP can be extended to oriented matroids which are combinatorial abstractions of linear subspaces of Euclidean spaces. This paper briefly surveys the LCP, oriented matroids and algorithms for the LCP on oriented matroids.

• 2000-03-25

著者

• Tamura Akihisa

  Research Institute for Mathematical Sciences, Kyoto University

• Tamura A

  Kyoto Univ. Kyoto Jpn

• Tamura Akihisa

  Research Institute For Mathematical Sciences Kyoto University

• TAMURA Akihisa

  Research Institute for Mathematical Science, Kyoto University

関連論文

• A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
• Application of M-Convex Submodular Flow Problem to Mathematical Economics
• The Linear Complementarity Problem on Oriented Matroids(Special Issue on Algorithm Engineering : Surveys)
• Applications of Discrete Convex Analysis to Mathematical Economics
• Polyhedral Proof of a Characterization of Perfect Bidirected Graphs

スポンサーリンク