Pages that link to "Item:Q1219828"
From MaRDI portal
The following pages link to Two special cases of the assignment problem (Q1219828):
Displaying 13 items.
- An \(O(n^2)\) algorithm for the limited-capacity many-to-many point matching in one dimension (Q329283) (← links)
- Assigning agents to a line (Q485809) (← links)
- Minimum many-to-many matchings for computing the distance between two sequences (Q497361) (← links)
- Computational geometric aspects of rhythm, melody, and voice-leading (Q733549) (← links)
- An algorithm for computing the restriction s|caffold assignment problem in computational biology (Q1041813) (← links)
- A linear time algorithm for a matching problem on the circle (Q1129000) (← links)
- Minimum-weight perfect matching for nonintrinsic distances on the line (Q1762537) (← links)
- Perspectives of Monge properties in optimization (Q1923588) (← links)
- Comment: Matching methods for observational studies derived from large administrative databases (Q2218056) (← links)
- Efficient many-to-Many point matching in one dimension (Q2373930) (← links)
- Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with monge costs (Q2811304) (← links)
- Fast algorithms for convex cost flow problems on circles, lines, and trees (Q2811315) (← links)
- Graded Matching for Large Observational Studies (Q5057279) (← links)
