Pages that link to "Item:Q1200788"
From MaRDI portal
The following pages link to Solving linear bottleneck assignment problems via strong spanning trees (Q1200788):
Displaying 9 items.
- Alternate strategies for solving bottleneck assignment problems - analysis and computational results (Q798564) (← links)
- Strong linear independence in bottleneck algebra (Q1094338) (← links)
- Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem (Q1337676) (← links)
- A new strongly polynomial dual network simplex algorithm (Q1373742) (← links)
- Solution methods and computational investigations for the linear bottleneck assignment problem (Q1377280) (← links)
- The bottleneck generalized assignment problem (Q1388853) (← links)
- On solving a variation of the assignment problem (Q1390267) (← links)
- A fast algorithm for a class of bottleneck problems (Q1916054) (← links)
- An improved algorithm for two stage time minimization assignment problem (Q2420663) (← links)