Pages that link to "Item:Q1377280"
From MaRDI portal
The following pages link to Solution methods and computational investigations for the linear bottleneck assignment problem (Q1377280):
Displaying 11 items.
- Selected topics on assignment problems (Q697571) (← links)
- Bottleneck flows in unit capacity networks (Q976109) (← links)
- A new matrix bandwidth reduction algorithm (Q1306383) (← links)
- An alternate approach to solve two-level priority based assignment problem (Q2114824) (← links)
- A priority based assignment problem (Q2293428) (← links)
- A priority based unbalanced time minimization assignment problem (Q2307977) (← links)
- An improved algorithm for two stage time minimization assignment problem (Q2420663) (← links)
- Sensitivity analysis for bottleneck assignment problems (Q2673565) (← links)
- Task preference-based bottleneck assignment problem (Q2675766) (← links)
- Quadratic bottleneck problems (Q5392805) (← links)
- Allocation of indivisible items with individual preference graphs (Q6157417) (← links)
