Pages that link to "Item:Q1244171"
From MaRDI portal
The following pages link to An augmenting path method for solving linear bottleneck assignment problems (Q1244171):
Displayed 19 items.
- Selected topics on assignment problems (Q697571) (← links)
- On a pair of job-machine assignment problems with two stages (Q732901) (← links)
- A multi-level bottleneck assignment approach to the bus drivers' rostering problem (Q792882) (← links)
- Alternate strategies for solving bottleneck assignment problems - analysis and computational results (Q798564) (← links)
- Improved polynomial algorithms for robust bottleneck problems with interval data (Q1046706) (← links)
- An algorithm for algebraic assignment problems (Q1138479) (← links)
- Duality for algebraic linear programming (Q1142711) (← links)
- Algorithm for the solution of the bottleneck assignment problem (Q1148790) (← links)
- A heuristic procedure for the crew rostering problem (Q1194743) (← links)
- Solving linear bottleneck assignment problems via strong spanning trees (Q1200788) (← links)
- An augmenting path method for solving linear bottleneck transportation problems (Q1254950) (← links)
- The partial sum criterion for Steiner trees in graphs and shortest paths (Q1278596) (← links)
- Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem (Q1337676) (← links)
- Solution methods and computational investigations for the linear bottleneck assignment problem (Q1377280) (← links)
- The bottleneck generalized assignment problem (Q1388853) (← links)
- A fast algorithm for a class of bottleneck problems (Q1916054) (← links)
- Duality and admissible transformations in combinatorial optimization (Q3048583) (← links)
- Primal transportation and transshipment algorithms (Q3863694) (← links)
- A class of bottleneck expansion problems (Q5936134) (← links)