Pages that link to "Item:Q1374026"

The following pages link to A new algorithm for the assignment problem: An alternative to the Hungarian method (Q1374026):

Displaying 18 items.

• The recurrent method to solve the assignment problem (Q269147) (← links)
• Method of sequential modification of the objective function in the assignment problem (Q384665) (← links)
• Algorithm for the minimax assignment problem with a sparse rectangular matrix (Q580163) (← links)
• A labeling algorithm for the sensitivity ranges of the assignment problem (Q651673) (← links)
• Classes of matrices associated with the optimal assignment problem (Q1081608) (← links)
• A labeling algorithm to solve the assignment problem (Q1823140) (← links)
• A novel convex dual approach to three-dimensional assignment problem: theoretical analysis (Q2007830) (← links)
• A study on two measurements-to-tracks data assignment algorithms (Q2384536) (← links)
• Data association approaches in bearings-only multi-target tracking (Q2459434) (← links)
• The computational efficiency of Ji-Lee-Li algorithm for the assignment problem (Q2867325) (← links)
• A note on Hungarian algorithm for assignment problems (Q2991031) (← links)
• A new method of solving assignment problems -- the target value submatrix method (Q3017061) (← links)
• (Q3626421) (← links)
• Threshold assignment algorithm (Q3743115) (← links)
• A dual forest algorithm for the assignment problem (Q3974955) (← links)
• A new assignment model and its algorithms (Q3981361) (← links)
• A new algorithm for stable assignment (Q4375407) (← links)
• A new algorithm of bearings-only multi-target tracking of bistatic system (Q5423430) (← links)