AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"

スポンサーリンク

概要

• 論文の詳細を見る

• The ordinary assignment problem on a bipartite graph with weighted arcs is extended to the case where both of the two sets of vertices of the graph are given matroidal structures, and a practical solution algorithm is presented to this extended problem.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Iri Masao

  Department Of Mathematical Engineering And Instrumentation Physics Faculty Of Engineering University

• Iri Masao

  Department Of Mathematical Engineering And Information Physics Faculty Of Engineering University Of

• Tomizawa Nobuaki

  Department Of Systems Science Graduate School Of Science And Engineering Tokyo Institute Of Technology

関連論文

• A Solid Modelling System Free from Topological Inconsistency
• Matroidal Approach to the Structural Solvability of a System of Equations
• On the Decomposition of a Directed Graph with Respect to Arborescences and Related Problems (Graphs and Combinatorics III)
• Parameter Tuning and Repeated Application of the IMT-Type Transformation in Numerical Quadrature (Numerical Integration and Related Topics)
• Estimates of Rounding Errors with Fast Automatic Differentiation and Interval Analysis
• An Overflow/Underflow-Free Floating-Point Representation of Numbers
• Fast Automatic Differentiation and Interval Estimates of rounding errors
• Theory and Applications of Principal Partitions of Matroids (Graphs and Combinatorics III)
• An Optimal Algorithm for Approximating a Piecewise Linear Function
• AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"

スポンサーリンク