LinearAssignment       package:GraphAlignment       R Documentation

_S_o_l_v_e _l_i_n_e_a_r _a_s_s_i_g_n_m_e_n_t _p_r_o_b_l_e_m

_D_e_s_c_r_i_p_t_i_o_n:

     Solve the linear assignment problem specified by the cost matrix.

_U_s_a_g_e:

     LinearAssignment(matrix)

_A_r_g_u_m_e_n_t_s:

  matrix: cost matrix

_D_e_t_a_i_l_s:

     This function solves the linear assignment problem defined by the
     input matrix. [Jonker, Volgenant 1987]

_V_a_l_u_e:

     The return value is a permutation vector equal to the solution of
     the linear assignment problem specified by the cost matrix. The
     result is the permutation P for which MP is minimal (where M is
     the cost matrix).

_A_u_t_h_o_r(_s):

     Joern P. Meier, Michal Kolar, Ville Mustonen, Michael Laessig, and
     Johannes Berg

_R_e_f_e_r_e_n_c_e_s:

     Jonker, R & Volgenant, A. (1987) Computing 38, 325-340.

_E_x_a_m_p_l_e_s:

       m <- matrix(rnorm(25), 5, 5)
       px <- LinearAssignment(round(-1000 * (m / max(abs(m)))))
       m[px,]

