Pages that link to "Item:Q3991697"
From MaRDI portal
The following pages link to A dual feasible forest algorithm for the linear assignment problem (Q3991697):
Displaying 5 items.
- A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
- Solving linear bottleneck assignment problems via strong spanning trees (Q1200788) (← links)
- An algorithm for fractional assignment problems (Q1842662) (← links)
- A non-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem (Q3815858) (← links)
- A dual forest algorithm for the assignment problem (Q3974955) (← links)