Pages that link to "Item:Q3565231"
From MaRDI portal
The following pages link to The Hungarian Method for the Assignment Problem (Q3565231):
Displaying 19 items.
- The recurrent method to solve the assignment problem (Q269147) (← links)
- Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication (Q623798) (← links)
- Classes of matrices associated with the optimal assignment problem (Q1081608) (← links)
- Revisiting the 0,1 assignment problem (Q1183142) (← links)
- A new algorithm for the assignment problem: An alternative to the Hungarian method (Q1374026) (← links)
- Solving a combinatorial problem with network flows (Q1767398) (← links)
- A labeling algorithm to solve the assignment problem (Q1823140) (← links)
- Open shop, satellite communication and a theorem by Egerváry (1931) (Q1919192) (← links)
- A tale of three eras: the discovery and rediscovery of the Hungarian method (Q1926686) (← links)
- Human steering angle estimation in video based on key point detection and Kalman filter (Q2089129) (← links)
- Optimal detection of the feature matching map in presence of noise and outliers (Q2106814) (← links)
- A note on Hungarian algorithm for assignment problems (Q2991031) (← links)
- Point Spread Function Field Learning Based on Optimal Transport Distances (Q3130757) (← links)
- Fast Convergence in the Double Oral Auction (Q3460777) (← links)
- (Q3626421) (← links)
- (Q4399158) (← links)
- On tropical Kleene star matrices and alcoved polytopes (Q5409922) (← links)
- Solving maximum weighted matching on large graphs with deep reinforcement learning (Q6125273) (← links)
- Consolidation of structure of high noise data by a new noise index and reinforcement learning (Q6205038) (← links)
