Pages that link to "Item:Q686416"
From MaRDI portal
The following pages link to A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416):
Displayed 7 items.
- A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
- A strongly polynomial simplex method for the linear fractional assignment problem (Q1003483) (← links)
- A polynomial time primal network simplex algorithm for minimum cost flows (Q1373741) (← links)
- A new pivot selection rule for the network simplex algorithm (Q1373743) (← links)
- Sensitivity analysis of the optimal assignment. (Q1811143) (← links)
- Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
- Collaborative assignment using belief-desire-intention agent modeling and negotiation with speedup strategies (Q2476755) (← links)